剑指 Offer 34. 二叉树中和为某一值的路径 || LeetCode 113. 路径总和 II

大佬

//众所周知，叶子节点是左右都为null doge
/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    List<List<Integer>> res = new ArrayList<List<Integer>>();
    List<Integer> tmp = new ArrayList<Integer>();
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        if(root == null)
            return res;
        dfs(root, sum);
        return res;
    }
    private void dfs(TreeNode root, int sum){
        if(root == null)
            return;
        tmp.add(root.val);
        sum -= root.val;
        if(sum == 0 && root.left == null && root.right == null)
            res.add(new ArrayList<>(tmp));
        dfs(root.left, sum);
        dfs(root.right, sum);
        tmp.remove(tmp.size() - 1);
    }
}