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.

Note: A leaf is a node with no children.

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

思路：就是backtracking，加完了，判断完了，要remove；remove list 最后一个是 remove(list.size() -1);

/**
 * 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 List<List<Integer>> pathSum(TreeNode root, int targetSum) {
        List<List<Integer>> lists = new ArrayList<List<Integer>>();
        List<Integer> list = new ArrayList<Integer>();
        pathSumHelper(root, targetSum, lists, list, 0);
        return lists;
    }
    
    private void pathSumHelper(TreeNode root, int targetSum, List<List<Integer>> lists,
                              List<Integer> list, int cursum) {
        if(root == null) {
            return;
        }
       
        if(root.left == null && root.right == null) {
            if(cursum + root.val == targetSum) {
                list.add(root.val);
                lists.add(new ArrayList<>(list));
                list.remove(list.size() - 1);
            }
            return;
        }
        
        list.add(root.val);
        pathSumHelper(root.left, targetSum, lists, list, cursum + root.val);
        list.remove(list.size() - 1);
        
        list.add(root.val);
        pathSumHelper(root.right, targetSum, lists, list, cursum + root.val);
        list.remove(list.size() - 1);
       
    }
}