1 题目
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.
Note: A leaf is a node with no children.
Example:
Input: [1,2,3]
1
/ \
2 3
Output: 25
Explanation:
The root-to-leaf path 1->2 represents the number 12.
The root-to-leaf path 1->3 represents the number 13.
Therefore, sum = 12 + 13 = 25.
Example 2:
Input: [4,9,0,5,1]
4
/ \
9 0
/ \
5 1
Output: 1026
Explanation:
The root-to-leaf path 4->9->5 represents the number 495.
The root-to-leaf path 4->9->1 represents the number 491.
The root-to-leaf path 4->0 represents the number 40.
Therefore, sum = 495 + 491 + 40 = 1026.
2 尝试解
class Solution {
public:
int sumNumbers(TreeNode* root) {
int result = 0;
add(root,result);
return result;
}
void add(TreeNode* root,int& sum){
if(root==NULL) return;
if(root->left == NULL && root->right == NULL){
sum += root->val;
return;
}
if(root->left != NULL){
root->left->val += 10*root->val;
}
if(root->right != NULL){
root->right->val += 10*root->val;
}
add(root->left,sum);
add(root->right,sum);
}
};
3 标准解
public class Solution {
public int sumNumbers(TreeNode root) {
if (root == null)
return 0;
return sumR(root, 0);
}
public int sumR(TreeNode root, int x) {
if (root.right == null && root.left == null)
return 10 * x + root.val;
int val = 0;
if (root.left != null)
val += sumR(root.left, 10 * x + root.val);
if (root.right != null)
val += sumR(root.right, 10 * x + root.val);
return val;
}
}