113. Path Sum II-CSDN博客

本文介绍了一个中等难度的算法问题——路径总和II，目标是在给定的二叉树中找到所有从根节点到叶子节点的路径，使得路径上的节点值之和等于给定的总和。文章详细解析了如何使用递归方法遍历树的每个节点，检查路径是否满足条件，并将符合条件的路径收集到结果列表中。

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

113. Path Sum II

Medium

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

Note: A leaf is a node with no children.

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]
]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<List<Integer>> pathSum(TreeNode root, int sum) {
        Stack<Integer> path = new Stack<>();
        List<List<Integer>> result = new ArrayList<>();
        if (null == root) {
            return result;
        }
        
        pathSum(root, sum, path, result);
        
        return result;
    }
    
    private void pathSum(TreeNode root, int sum, Stack<Integer> path, List<List<Integer>> result) {
        if (null == root) {
            return;
        }
        
        if (null == root.left && null == root.right) {
            if (0 == sum - root.val) {
                path.push(root.val);
                result.add(new ArrayList(path));
                path.pop();
            } 
        } else {
            path.push(root.val);
            pathSum(root.left, sum - root.val, path, result);
            pathSum(root.right, sum - root.val, path, result);
            path.pop();
        }
    }
}