LeetCode知识点总结 - 437

jeeeee_no

已于 2022-11-24 17:05:17 修改

阅读量111

点赞数

分类专栏： LeetCode 文章标签： leetcode 深度优先算法

于 2022-11-24 17:01:29 首次发布

本文链接：https://blog.csdn.net/m0_59773145/article/details/128021674

版权

LeetCode 专栏收录该内容

417 篇文章 1 订阅

订阅专栏

该博客详细介绍了如何解决LeetCode中的437题，即寻找二叉树中和为目标值的路径数量。博主通过深度优先搜索（DFS）策略，利用全局变量记录结果，并使用字典缓存中间结果，实现了从根节点到任意节点的路径和。在离开路径时，博主清除了当前路径和，以避免重复计数。最后返回结果。此题属于中等难度，主要考察了二叉树遍历和动态规划的知识。

摘要由CSDN通过智能技术生成

LeetCode 437. Path Sum III

考点	难度
DFS	Medium

题目

Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum.

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

思路

对每个node, 如果从root到node的所有和为currentsum, 如果这条path上有满足条件的说明有oldsum = currentsum - target, 所以只需要数oldsum出现的次数。
离开path之前需要清空cache。

答案

class Solution(object):
    def pathSum(self, root, target):
        # define global result and path
        self.result = 0
        cache = {0:1}
        
        # recursive to get result
        self.dfs(root, target, 0, cache)
        
        # return result
        return self.result
    
    def dfs(self, root, target, currPathSum, cache):
        # exit condition
        if root is None:
            return  
        # calculate currPathSum and required oldPathSum
        currPathSum += root.val
        oldPathSum = currPathSum - target
        # update result and cache
        self.result += cache.get(oldPathSum, 0)
        cache[currPathSum] = cache.get(currPathSum, 0) + 1
        
        # dfs breakdown
        self.dfs(root.left, target, currPathSum, cache)
        self.dfs(root.right, target, currPathSum, cache)
        # when move to a different branch, the currPathSum is no longer available, hence remove one. 
        cache[currPathSum] -= 1