剑指 Offer 34. 二叉树中和为某一值的路径
题目
给你二叉树的根节点 root 和一个整数目标和 targetSum ,找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。
叶子节点 是指没有子节点的节点。
示例 1:
输入:root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出:[[5,4,11,2],[5,8,4,5]]
示例 2:
输入:root = [1,2,3], targetSum = 5
输出:[]
示例 3:
输入:root = [1,2], targetSum = 0
输出:[]
提示
树中节点总数在范围 [0, 5000] 内
-1000 <= Node.val <= 1000
-1000 <= targetSum <= 1000
题解
dfs深度优先搜索,需要注意的是,存储列表的时候应当复制一个新的存入结果集,否则回溯时会清除结果。
Code
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public List<List<Integer>> pathSum(TreeNode root, int target) {
ArrayList<List<Integer>> lists = new ArrayList<>();
if(root == null)
return lists;
LinkedList<Integer> list = new LinkedList<>();
dfs(root, lists, list, 0, target);
return lists;
}
public static void dfs(TreeNode node, ArrayList<List<Integer>> lists,
LinkedList<Integer> list, int sum, int target){
if(node == null)
return;
sum = sum + node.val;
list.add(node.val);
if(node.left == null && node.right == null && sum == target){
lists.add(new LinkedList<>(list));
}
dfs(node.left, lists, list, sum, target);
dfs(node.right, lists, list, sum, target);
sum -= node.val;
list.removeLast();
}
}