LeetCode-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 andsum = 22,

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

return

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

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.ArrayList;
public class Solution {
    ArrayList<ArrayList<Integer>> paths;
    public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
        paths = new ArrayList<ArrayList<Integer>>();
        if(root == null) {
            return paths;
        }
        ArrayList<Integer> path = new ArrayList<Integer>();
        pathSum(root, 0, sum, path);
        return paths;
    }
     
    public void pathSum(TreeNode root, int res, int sum, ArrayList<Integer> path) {
        if(root == null) {
            return ;
        } else if(root.left == null && root.right == null) {
            if(res + root.val == sum) {
                path.add(root.val);
                paths.add(new ArrayList<Integer>(path));
                path.remove(path.size() - 1);
            }
        } else {
            path.add(root.val);
            pathSum(root.left, res + root.val, sum, path);
            pathSum(root.right, res + root.val, sum, path);
            path.remove(path.size() - 1);
        }
    }
}