题目:
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.
题意:
给定一棵二叉树,每个元素的值是0-9,从根到叶子的路径代表了一个数,比如上面的例子,有两条路径1->2以及1->3,所代表的就是两个数12与13,所以它们的和就是25。
思路:
采用递归的思路,函数的参数包括当前的节点,以及到达当前节点时已经走的那些数字,比如路径1->2->3->4,1->2->3->5到达3时已经走的路径是12,即此时传入的参数是12,访问当前节点,发现3有孩子节点4以及5,那么将3加入到路径中,即12*10 + 3=123,传入下一层递归,即3的左右孩子的递归,并将左右孩子的结果求和,即1234+1235=2469。
以上。
代码如下:
/**
* 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) {
if(root == NULL)return 0;
return backTracking(root, 0);
}
int backTracking(TreeNode* root,int result) {
if(root == NULL)return 0;
result = result*10 + root->val;
if(root->left == NULL && root->right == NULL)return result;
int left = backTracking(root->left,result);
int right = backTracking(root->right, result);
return left + right;
}
};