【LeetCode】 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]
]

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