leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1302.cpp (504B)

0 class Solution { 1 public: 2 int deepestLeavesSum(TreeNode *root) { 3 int sum = 0; 4 5 queue<TreeNode *> q; 6 q.push(root); 7 while (!q.empty()) { 8 sum = 0; 9 for (int k = q.size(); k > 0; k--) { 10 TreeNode *root = q.front(); 11 q.pop(); 12 sum += root->val; 13 if (root->left) q.push(root->left); 14 if (root->right) q.push(root->right); 15 } 16 } 17 return sum; 18 } 19 };