437. Path Sum III-CSDN博客

本文链接：https://blog.csdn.net/ALLENYYE/article/details/102763478

本文介绍了一种解决二叉树中寻找特定和路径的问题，通过预处理前缀和并利用哈希表来高效查找匹配路径，实现了在大量节点中快速定位到目标路径。

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

You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it must go downwards (traveling only from parent nodes to child nodes).

The tree has no more than 1,000 nodes and the values are in the range -1,000,000 to 1,000,000.

Example:

root = [10,5,-3,3,2,null,11,3,-2,null,1], sum = 8

      10
     /  \
    5   -3
   / \    \
  3   2   11
 / \   \
3  -2   1

Return 3. The paths that sum to 8 are:

1.  5 -> 3
2.  5 -> 2 -> 1
3. -3 -> 11

扫边，把每条边看做一个数组，这样问题就变成了数组中找到和为target的subarray。
就可以使用preSum的方法来做。定义一个map <preSum , freq>

class Solution {
    public int pathSum(TreeNode root, int sum) {
        int result = 0;
        if (root == null) {
            return result;
        }
        Map<Integer, Integer> preSumToFreq = new HashMap<>();
        preSumToFreq.put(0, 1);
        result = dfs(root, 0, sum, preSumToFreq, result);
        return result;
    }
    
    private int dfs(TreeNode node, int preSum, int sum, 
                    Map<Integer, Integer> preSumToFreq, int result) {
        preSum += node.val;
        if (preSumToFreq.containsKey(preSum - sum)) {
            result += preSumToFreq.get(preSum - sum);
        }
        
        if (!preSumToFreq.containsKey(preSum)) {
            preSumToFreq.put(preSum, 1);
        } else {
            preSumToFreq.put(preSum, preSumToFreq.get(preSum) + 1);
        }

        if (node.left != null) {
            result = dfs(node.left, preSum, sum, preSumToFreq, result);
        }
        if (node.right != null) {
            result = dfs(node.right, preSum, sum, preSumToFreq, result);
        }
        
        preSumToFreq.put(preSum, preSumToFreq.get(preSum) - 1);
        
        return result;   
    }
}