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.
很简单的题……
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32 |
/** * 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; bi(root,0); return
sum; } void
bi(TreeNode *root ,int
num) { num*=10; num+=root->val; if(root->left == NULL && root->right == NULL) { sum += num; return; } if(root->left != NULL) bi(root->left,num); if(root->right != NULL)bi(root->right,num); }}; |
Sum Root to Leaf Numbers,布布扣,bubuko.com
原文：http://www.cnblogs.com/pengyu2003/p/3580484.html