#129 Sum Root to Leaf Numbers

Description

You are given the root of a binary tree containing digits from 0 to 9 only.

Each root-to-leaf path in the tree represents a number.

For example, the root-to-leaf path 1 -> 2 -> 3 represents the number 123.
Return the total sum of all root-to-leaf numbers. Test cases are generated so that the answer will fit in a 32-bit integer.

A leaf node is a node with no children.

Examples

Example 1:

Input: root = [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: root = [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.

Constraints:

The number of nodes in the tree is in the range [1, 1000].
0 <= Node.val <= 9
The depth of the tree will not exceed 10.

思路

就是树的遍历，用recursive和queue都能做，recursive会快一点

代码

recursive

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution 
{
    public int res;
    public int sumNumbers(TreeNode root) {
        res = 0;
        recursive(root, 0);
        return res;
    }
    
    private void recursive(TreeNode root, int sum) {
        if (root == null)
            return;
        sum = (sum * 10) + root.val;
        if (root.left == null && root.right == null) {
            res  = res + sum;
        }
        
        recursive(root.left, sum);
        recursive(root.right, sum);  
    }
}

queue

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int sumNumbers(TreeNode root) {
        int count = 0;
        
        List<Integer> nextLayerVal = new ArrayList<>();
        List<TreeNode> nextLayer = new ArrayList<>();
        nextLayerVal.add(root.val);
        nextLayer.add(root);
        
        while(nextLayer.size() > 0) {
            TreeNode currNode = nextLayer.get(0);
            if (currNode.left == null){
                if (currNode.right == null)
                    count += nextLayerVal.get(0);
                else {
                    nextLayer.add(currNode.right);
                    nextLayerVal.add(nextLayerVal.get(0) * 10 + currNode.right.val);
                }
            }
            else {
                nextLayer.add(currNode.left);
                nextLayerVal.add(nextLayerVal.get(0) * 10 + currNode.left.val);
                if (currNode.right != null) {
                    nextLayer.add(currNode.right);
                    nextLayerVal.add(nextLayerVal.get(0) * 10 + currNode.right.val);
                }
            }
            nextLayer.remove(0);
            nextLayerVal.remove(0);
        }
        
        return count;
    }
}