leetcode Sum Root to Leaf Numbers题解

题目描述：

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.

中文理解：

给定一个二叉树，每个从根到叶子路径的序列构成一个整数，高度越低位数越高，比如深度序列3->1->2，构成整数312，求出所有路径的数值之和。

解题思路：

使用回溯法进行递归，每一个从根到叶节点的路径保存在回溯的数列中，每次达到叶子节点就将所有节点的值构成一个整数。

代码（java）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int sumNumbers(TreeNode root) {
        int sum=0;
        if(root==null)return sum;
        ArrayList<Integer> list=new ArrayList();
        sum=dfs(list,root);
        return sum;
    }
    public int dfs(ArrayList<Integer> list,TreeNode root){
        if(root==null)return 0;
        list.add(root.val);
        int pathsum=0;
        if(root.left==null && root.right==null){
            for(int i=0;i<list.size();i++){
                pathsum=list.get(i)+pathsum*10;
            }
        }
        else if(root.left!=null || root.right!=null){
            pathsum+=dfs(list,root.left);
            pathsum+=dfs(list,root.right);
        }
        list.remove(list.size()-1);
        return pathsum;
    }
}