题意:
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
.
难度:Medium
解题思路: 很容易想到利用深度优先搜索,对于每个结点,对左右子树(如果存在的话)分别进行遍历,每到一个新的层,就把上一层的值乘以10,加上当前结点的值,得到新值,再以左子树(或右子树)节点作为根节点,继续递归将刚才求得的新值传递下去,直到没有子树时不再传递。 记lsum为向左子树遍历取得的数串,rsum为向右子树遍历取得的数串,二者相加即为当前根节点向左右叶子路径数串之和。T(n)=2T(n/2)+O(1),所以时间复杂度为O(n)
/**
* 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 helper(TreeNode* root,int sum)
{
int lsum=0,rsum=0;
if(root==NULL)
return 0;
if(root->left==NULL&&root->right==NULL)
return sum*10+root->val;
if(root->left!=NULL){
lsum=helper(root->left,sum*10+root->val);
}
if(root->right!=NULL){
rsum=helper(root->right,sum*10+root->val);
}
return lsum+rsum;
}
int sumNumbers(TreeNode* root) {
return helper(root,0);
}
};