题目:
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) {
int sum = 0;
int oneNumber = 0;
sumNumbersCore(root, oneNumber, sum);
return sum;
}
private:
void sumNumbersCore(TreeNode *root, int oneNumber, int &sum){
if(NULL == root) return;
oneNumber = 10 * oneNumber + root->val;
if(NULL == root->left && NULL == root->right) {//叶节点
sum += oneNumber;
return;
}
if(root->left) sumNumbersCore(root->left, oneNumber, sum);
if(root->right) sumNumbersCore(root->right, oneNumber, sum);
}
};