题目所属分类
属于dfs
原题链接
给你二叉树的根节点 root 和一个整数目标和 targetSum ,找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。
叶子节点 是指没有子节点的节点。
代码案例:
输入:root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
输出:[[5,4,11,2],[5,8,4,5]]
题解
/**
* 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 {
List<List<Integer>> ans = new ArrayList<>();
List<Integer> path = new ArrayList<>();
public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
if(root == null) return ans ;
dfs(root,targetSum);
return ans ;
}
public void dfs(TreeNode root, int target){
path.add(root.val);
target -= root.val;
if(root.left == null && root.right == null){
if(target == 0){
ans.add(new ArrayList<>(path));
}
}else {
if(root.left != null) dfs(root.left , target);
if(root.right != null) dfs(root.right, target);
}
path.remove(path.size()-1);
}
}