LeetCode 39 Path Sum II_currpaths.remove(currpaths.size()-1);-CSDN博客

本文链接：https://blog.csdn.net/javyzheng/article/details/38945803

本文介绍了一种算法，用于查找二叉树中所有从根节点到叶子节点的路径，这些路径上的数值之和等于给定的目标值。通过深度优先搜索(DFS)实现递归回溯，最终找到所有符合条件的路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

For example:

Given the below binary tree and sum=22.

      5
     / \
    4   8
   /   / \
  11  13  4
 / \     / \
7   2   5   1

return

[
  [5,4,11,2],
  [5,8,4,5]
]

分析：

看到二叉树，想递归，

看到find all，想回溯，继而想到 DFS。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        List<List<Integer>> result = new ArrayList<List<Integer>>();
        if(root == null) return result;
        List<Integer> curr = new ArrayList<Integer>();
        curr.add(root.val);
        dfs(root, sum-root.val, curr, result);
        return result;
    }
    
    private void dfs(TreeNode node, int remain, List<Integer> curr, List<List<Integer>> result){
        if(node == null) return;
        if(node.left==null && node.right==null && remain == 0){
            result.add(new ArrayList<Integer>(curr));
            return;
        }
        if(node.left != null){
            curr.add(node.left.val);
            dfs(node.left, remain-node.left.val, curr, result);
            curr.remove(curr.size()-1);
        }
        if(node.right != null){
            curr.add(node.right.val);
            dfs(node.right, remain-node.right.val, curr, result);
            curr.remove(curr.size()-1);
        }
        
        
    }
}