训练营一期day15

104. 二叉树的最大深度​​​​​

昨日已经做过。今日用的是新方法。

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def maxDepth(self, root: Optional[TreeNode]) -> int:
        if not root:
            return 0
        else:
            left = self.maxDepth(root.left) 
            right = self.maxDepth(root.right)
            return max(left,right) + 1

111. 二叉树的最小深度

昨日已经做过。今日用的是新方法。

犯了代码随想录说的错误:

leftDepth = self.minDepth(node.left);
rightDepth = self.minDepth(node.right);
result = 1 + min(leftDepth, rightDepth);
return result;

更改后:

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def minDepth(self, root: Optional[TreeNode]) -> int:
        if not root:
            return 0      
        if root.left is None and root.right is not None:
            return 1+self.minDepth(root.right)
        if root.left is not None and root.right is None:
            return 1+self.minDepth(root.left)
        left = self.minDepth(root.left)
        right = self.minDepth(root.right)
        return min(left,right) + 1

222. 完全二叉树的节点个数

这个题用前中后序遍历都可以做

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def countNodes(self, root: Optional[TreeNode]) -> int:
        res = []
        def dfs(node):
            if node == None:
                return 
            res.append(node.val)
            dfs(node.left)
            dfs(node.right)

        dfs(root)
        return len(res)

代码随想录的想法:

class Solution:
    def countNodes(self, root: TreeNode) -> int:
        if not root:
            return 0
        return 1 + self.countNodes(root.left) + self.countNodes(root.right)

559. N 叉树的最大深度

类429

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root:
            return 0
        res = []
        queue = [[root]]
 
        while queue:
            one = []
            for nodes in queue:
                for node in nodes:
                    one.append(node.val)
            res.append(one)
            ll = []
            for nodes in queue:
                for node in nodes:
                    if node.children:
                        ll.append(node.children)
            queue = ll
 
        return len(res)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值