113. Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:
Given the below binary tree and  sum = 22 ,

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \    / \
        7    2  5   1

return

[
   [5,4,11,2],
   [5,8,4,5]
]

思路：

递归删除cache中的内容时，不要使用cache.remove((Integer)root.val);因为本题val值会重复，最后导致输出的顺序不对。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    static List<List<Integer>> res = null;
    
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        res = new ArrayList<List<Integer>>();
		List<Integer> cache = new ArrayList<Integer>();
		find(root, sum, 0, cache);
		return res;
    }
    
	private static void find(TreeNode root, int sum, int count,
			List<Integer> cache) {
		if (root == null) {
			return;
		}
		cache.add(root.val);
		count += root.val;
		if (root.left == null && root.right == null && count == sum) {
			res.add(new ArrayList<Integer>(cache));
		}
		find(root.left, sum, count, cache);
		find(root.right, sum, count, cache);
		cache.remove(cache.size() - 1);
	}
}