【LeetCode】#113路径总和II(Path Sum II)

【LeetCode】#113路径总和II(Path Sum II)

题目描述

给定一个二叉树和一个目标和，找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。

示例

给定如下二叉树，以及目标和 sum = 22，
5
/
4 8
/ /
11 13 4
/ \ /
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]

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

解法

class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> res = new LinkedList<>();
        List<Integer> list = new LinkedList<>();
        helper(res, root, sum, list);
        return res;
    }
    public void helper(List<List<Integer>> res, TreeNode root, int sum, List<Integer> list){
        if(root==null) return;
        if(root.left==null && root.right==null){
            if(sum==root.val){
                List<Integer> copy = new LinkedList<>(list);
                copy.add(root.val);
                res.add(copy);
            }
            return;
        }
        if(root.left!=null){
            list.add(root.val);
            helper(res, root.left, sum-root.val, list);
            list.remove(list.size()-1);
        }
        if(root.right!=null){
            list.add(root.val);
            helper(res, root.right, sum-root.val, list);
            list.remove(list.size()-1);
        }
    }
}