Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

429. N 叉树的层序遍历 #89

Open
Labels
@Geekhyt

Description

原题链接

队列 bfs

使用队列进行广度优先遍历,level 数组存放当前层级的值,处理完一层后推入结果数组 result。

const levelOrder = function(root) {
 if (root == null) return []
 const result = []
 const queue = [root] 
 
 while (queue.length > 0) {
 const levelSize = queue.length
 const level = [] 
 for (let i = 0; i < levelSize; i++) { 
 const head = queue.shift()
 for (const child of head.children) {
 queue.push(child)
 }
 level.push(head.val) 
 }
 result.push(level)
 }
 return result
}
  • 时间复杂度:O(n)
  • 空间复杂度:O(n)

Metadata

Metadata

Assignees

No one assigned

    Labels

    Projects

    No projects

    Milestone

    No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions

        AltStyle によって変換されたページ (->オリジナル) /