版权声明:噗噗个噗~~~ https://blog.csdn.net/Puyar_/article/details/85289344
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.
An example is the root-to-leaf path1->2->3which represents the number123.
Find the total sum of all root-to-leaf numbers.
For example,
1 / \ 2 3
The root-to-leaf path1->2represents the number12.
The root-to-leaf path1->3represents the number13.
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 sum=0;
int sumNumbers(TreeNode *root) {
if(root==NULL)return 0;
run(root,0);
return sum;
}
void run(TreeNode *root,int num)
{
num=num*10+root->val;
if(root->left==NULL&&root->right==NULL){
sum+=num;
return ;
}
if(root->left!=NULL)run(root->left,num);
if(root->right!=NULL)run(root->right,num);
}
};