leetCode#129. Sum Root to Leaf Numbers faster than 100%

129. Sum Root to Leaf Numbers
     Medium

957

29

Add to List

Share
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.

看到树基本上就是递归和链表或堆栈三种解题思路

一看到算sum，sum = sum*10+root.val;
因此想到用递归去解
刚开始写道一个method中，缺少一个input 后来便改为两个method
递归相对简单
就是return left +right

class Solution {
    public int sumNumbers(TreeNode root) {
        return sum(root,0);
            
    }
    
    public int sum(TreeNode root, int sum){
        
        if(root ==null){
            return 0;
        }
        sum = sum*10+root.val;
        
        if (root.left == null && root.right ==null) {
            return sum;
        }
        
       return sum(root.left,sum)+sum(root.right,sum);
    }
}```


需要注意的就是一定要排空
然后递归一定要再当前method运算当前的值