559. N 叉树的最大深度

陆佃

关注

阅读 69

2022-07-04


文章目录

  • ​​Question​​
  • ​​Ideas​​
  • ​​Code​​

Question

​​559. N 叉树的最大深度​​

Ideas

层序遍历,每遍历一层res+1 res为输出

Code

"""
# 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:
res = 0
if not root:
return res
q = [root]
while q:
length = len(q)
res += 1
for _ in range(length):
node = q.pop(0)
if node.children:
q.extend(node.children)


return res


精彩评论(0)

0 0 举报