FilesExpand file tree

 master

/

LevelOrder.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

42 lines (36 loc) · 1.07 KB

 master

/

LevelOrder.java

Top

File metadata and controls

• Code
• Blame

42 lines (36 loc) · 1.07 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

package com.lga.algorithm.tag.homework.Week_02;

import com.lga.datastruct.lru.Node;

import java.security.cert.PolicyQualifierInfo;

import java.util.LinkedList;

import java.util.List;

import java.util.Queue;

import java.util.Stack;

/**

* 429. N叉树的层序遍历

* https://leetcode-cn.com/problems/n-ary-tree-level-order-traversal/

*/

public class LevelOrder {

/**

* queue 实现层次遍历

* @param root

* @return

*/

public List<List<Integer>> levelOrder(Node root) {

List<List<Integer>> ans = new LinkedList<>();

Queue<Node> queue = new LinkedList();

if (root == null) return ans;

queue.add(root);

while (!queue.isEmpty()) {

List<Integer> tempList = new LinkedList<>();

int queueLength = queue.size();

while (queueLength > 0) {

Node tempNode = queue.poll();

tempList.add(tempNode.val);

queue.addAll(tempNode.children);

queueLength--;

}

ans.add(tempList);

}

return ans;

}

}