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 binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int get(TreeNode* root, int pre)
{
if (0 == root) return 0;
if (0 == root->left && 0 == root->right)
return pre * 10 + root->val;
return get(root->left, pre*10 + root->val) +
get(root->right, pre*10 + root->val);
}
int sumNumbers(TreeNode *root)
{
return get(root, 0);
}
};