一、题目
力扣原题:https://leetcode-cn.com/problems/path-sum-ii/
【二叉树】路径总和:https://blog.csdn.net/sinat_34596644/article/details/106109952
二、DFS+回溯
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int target;
private List<List<Integer>> result;
public List<List<Integer>> pathSum(TreeNode root, int sum) {
if (null == root) {
return new ArrayList<>();
}
this.target = sum;
this.result = new ArrayList<>();
dfs(root, 0, new ArrayList<Integer>());
return this.result;
}
private void dfs(TreeNode r