Bottom up专题四 LeetCode 113. Path Sum II

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.

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

Top-down的做法：

  public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;
        helper(root, sum, 0, result, new ArrayList<>());
        return result;
    }
    public void helper(TreeNode root, int sum, int cur, List<List<Integer>> result, List<Integer> path) {
        if (root == null) return;
        if (root.left == null && root.right == null && cur + root.val == sum) {
            path.add(root.val);
            result.add(new ArrayList<>(path));
            path.remove(path.size() - 1);
            return;
        }
        path.add(root.val);
        helper(root.left, sum, cur + root.val, result, path);
        helper(root.right, sum, cur + root.val, result, path);
        path.remove(path.size() - 1);
        return;
    }

Bottom up的做法:

    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> result = new ArrayList<>();
        if (root == null) return result;
        return helper(root, sum);
    }
    private List<List<Integer>> helper(TreeNode root, int sum) {
        List<List<Integer>> res = new ArrayList<>();
        
        if (root.left == null && root.right == null && sum == root.val) {
            List<Integer> path = new ArrayList<>();
            path.add(root.val);
            res.add(path);
            return res;
        }
        
        if (root.left != null) {
            List<List<Integer>> left = helper(root.left, sum - root.val);
            res.addAll(left);
        }
        if (root.right != null) {
            List<List<Integer>> right = helper(root.right, sum - root.val);
            res.addAll(right);
        }
        for (List<Integer> l : res) {
            l.add(0, root.val);
        }
        return res;
    }