【LeetCode】Sum Root to Leaf Numbers

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

睡前在A一道。
求路径的问题，还是很值得去做的。
需要注意的是，如果左右孩子都为空，才算叶子节点。
例如这样的

应该只有1-2，和1-3-5两条路径，sum是12+135 = 147。
dfs求路径吧。
Java AC

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int sumNumbers(TreeNode root) {
        if(root == null){
            return 0;
        }
        List<String> numList = new ArrayList<String>();
        StringBuffer sb = new StringBuffer();
        dfs(root, numList ,sb);
        int size = numList.size();
        int result = 0;
        for(int i = 0; i < size; i++){
            result += Integer.parseInt(numList.get(i));
        }
        return result;
    }
    public void dfs(TreeNode point, List<String> numList , StringBuffer sb){
        if (point == null) {
			return;
		}
    	if(point.left == null && point.right == null){
    		sb.append(point.val);
        	String tempStr = sb.toString();
			numList.add(tempStr);
            return;
        }
        StringBuffer newsb = new StringBuffer(sb);
        sb.append(point.val);
        dfs(point.left, numList, sb);
        newsb.append(point.val);
        dfs(point.right, numList, newsb);
    }
}