题目描述
给你二叉树的根节点 root 和一个整数目标和 targetSum ,找出所有 从根节点到叶子节点 路径总和等于给定目标和的路径。
叶子节点 是指没有子节点的节点。
题解
/**
* 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>> res = new ArrayList<>();
List<Integer> tmp = new ArrayList<>();
public List<List<Integer>> pathSum(TreeNode root, int targetSum) {
backtracking(root, targetSum);
return res;
}
public void backtracking(TreeNode root, int targetSum) {
if(root == null) {
return;
}
tmp.add(root.val);
if(root.left == null && root.right == null && targetSum - root.val == 0) {
res.add(new ArrayList(tmp));
}
backtracking(root.left, targetSum - root.val);
backtracking(root.right, targetSum - root.val);
tmp.remove(tmp.size() - 1);
}
}