[Leetcode] 979. Distribute Coins in Binary Tree

最新推荐文章于 2024-11-06 23:21:54 发布

朱枫

最新推荐文章于 2024-11-06 23:21:54 发布

阅读量91

点赞数

分类专栏： algorithm 文章标签： dfs leetcode 算法二叉树

本文链接：https://blog.csdn.net/weixin_44473990/article/details/111656503

版权

algorithm 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

这篇博客讨论了一种使用深度优先搜索（DFS）解决二叉树节点硬币分配问题的方法。在每个子树中，除根节点外的所有节点值设为1，根节点值可能不同。通过递归的DFS处理左子树和右子树，确保子树根节点的值为1。同时，博主尝试了迭代方法，但在某些情况下（如输入[0,0,null,0,0,4,null,null,0,3]）出现了错误，因为额外的值没有分配给根节点，而是分给了分叉节点并重新分布。

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

方法1： DFS

divide-and-conquer: by dfs, all nodes of a subtree have val of 1, except that the root node of the subtree may have different values. The dfs process will deal with root node in left subtree and root node in right subtree, to make the substree root node have val of 1.

class Solution:
    def distributeCoins(self, root: TreeNode) -> int:
        return self.dfs(root)
    
    def dfs(self, root):
        if root is None:
            return 0
        left = self.dfs(root.left)
        right = self.dfs(root.right)
        res = (left + right)
        if root.left:
            tmp = root.left.val
            root.left.val = 1
            root.val += (tmp - 1)
            res += abs(tmp - 1)
        if root.right:
            tmp = root.right.val
            root.right.val = 1
            root.val += (tmp - 1)
            res += abs(tmp - 1)
        return res

** Also tried iterative method that using parent node and the path for each node is to the root or to parent with value > 0, but it’s wrong in some cases, for example:
Input:
[0,0,null,0,0,4,null,null,0,3]
Output:
17
Expected:
15
In this case, the additional value doesn’t go to root, but to the forking node and then re-distribute.