Leetcode 129. Sum Root to Leaf Numbers (Medium) (cpp)
Tag: Tree, Depth-first Search
Difficulty: Medium
/*
129. Sum Root to Leaf Numbers (Medium)
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Find the total sum of all root-to-leaf numbers.
For example,
1
/ \
2 3
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Return the sum = 12 + 13 = 25.
*/
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int sumNumbers(TreeNode* root) {
vector<int> nums;
int num = 0;
sumNumber(root, nums, num);
num = 0;
for (int i : nums) {
num += i;
}
return num;
}
private:
void sumNumber(TreeNode* root, vector<int>& nums, int& num) {
if (root == NULL) {
nums.push_back(0);
return;
}
num = 10 * num + root->val;
if (root->left == NULL && root->right == NULL) {
nums.push_back(num);
num /= 10;
return;
}
if (root->left != NULL) {
sumNumber(root->left, nums, num);
}
if (root->right != NULL) {
sumNumber(root->right, nums, num);
}
num /= 10;
}
};