目录结构
1.题目
给定一个二叉树和一个目标和,找到所有从根节点到叶子节点路径总和等于给定目标和的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/path-sum-ii
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
public class Solution113 {
@Test
public void test113() {
TreeNode left = new TreeNode(4, new TreeNode(11, new TreeNode(7), new TreeNode(2)), null);
TreeNode right = new TreeNode(8, new TreeNode(13), new TreeNode(4, new TreeNode(5), new TreeNode(1)));
TreeNode root = new TreeNode(5, left, right);
System.out.println(pathSum(root, 22));
}
List<List<Integer>> result;
int sum;
public List<List<Integer>> pathSum(TreeNode root, int sum) {
result = new ArrayList<>();
this.sum = sum;
int tmpSum = 0;
preOrder(root, tmpSum, new ArrayList<>());
return result;
}
public void preOrder(TreeNode root, int tmpSum, List<Integer> list) {
if (root != null) {
tmpSum += root.val;
list.add(root.val);
if (tmpSum == sum && root.left == null && root.right == null) {
result.add(new ArrayList<>(list));
}
if (root.left != null) {
preOrder(root.left, tmpSum, new ArrayList<>(list));
}
if (root.right != null) {
preOrder(root.right, tmpSum, new ArrayList<>(list));
}
}
}
}