/**
* 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 total_sum=0;
void cal_sum(TreeNode* root,int sum){
if(!root->left&&!root->right)total_sum+=(sum*10+root->val);
else{
if(root->left)cal_sum(root->left, sum*10+root->val);
if(root->right)cal_sum(root->right, sum*10+root->val);
}
}
int sumNumbers(TreeNode* root) {
if(!root)return 0;
cal_sum(root, 0);
return total_sum;
}
};
129. Sum Root to Leaf Numbers
最新推荐文章于 2020-10-29 09:30:55 发布