113. Path Sum II

Description

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

Problem URL

---

Solution

给一棵二叉树，和一个sum，找到所有的加和为sum的从root到leaf的path，返回为一个list。

Using a global variable res to store the result. Using a DFS recursion to iterate each path. If path curSum == sum, add it to result. Traverse from left to right child. Every time the recursion function ends, remove last element in the path list for uper level resuse.

Code

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

Time Complexity: O(n)
Space Complexity: O(n)

---

Review