leetcode5/Path_Sum_II.java at master · 1code/leetcode5 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*
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 binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */

//By Ke Hu (mrhuke@gmail.com), 2013
public class Solution {

    public void pathSum(TreeNode root, int sum, ArrayList<ArrayList<Integer>> allPath, ArrayList<Integer> curPath)
    {
        if (root == null) return;
        if (sum == root.val && root.left == null && root.right == null){
            curPath.add(root.val);
            allPath.add(new ArrayList<Integer>(curPath));
            curPath.remove(curPath.size()-1);
            return;
        }

        curPath.add(root.val);
        pathSum(root.left, sum-root.val, allPath, curPath);
        pathSum(root.right, sum-root.val, allPath, curPath);
        curPath.remove(curPath.size()-1);

    }

    public ArrayList<ArrayList<Integer>> pathSum(TreeNode root, int sum) {
        ArrayList<ArrayList<Integer>> res = new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> cur = new ArrayList<Integer>();
        pathSum(root, sum, res, cur);
        return res;
    }
}