Skip to content

Commit bfc9879

Browse files
authored
Merge pull request gzc426#343 from u-hechongyang/master
4
2 parents b697457 + f06d8a0 commit bfc9879

File tree

1 file changed

+37
-0
lines changed

1 file changed

+37
-0
lines changed

2018.12.05-leetcode102/阳.md

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
class Solution {
2+
public class TreeNode {
3+
int val;
4+
TreeNode left;
5+
TreeNode right;
6+
7+
TreeNode(int x) {
8+
val = x;
9+
}
10+
}
11+
12+
public List<List<Integer>> levelOrder(TreeNode root) {
13+
List<List<Integer>> list = new LinkedList<List<Integer>>();
14+
if(root == null) {
15+
return list;
16+
}
17+
Queue<TreeNode> queue = new LinkedList<TreeNode>();
18+
queue.add(root);
19+
20+
while(!queue.isEmpty()) {
21+
List<Integer> sublist = new LinkedList<Integer>();
22+
int size = queue.size();
23+
for(int i = 0; i < size; i++) {
24+
TreeNode currentNode = queue.poll();
25+
sublist.add(currentNode.val);
26+
if(currentNode.left!=null) {
27+
queue.add(currentNode.left);
28+
}
29+
if(currentNode.right!=null) {
30+
queue.add(currentNode.right);
31+
}
32+
}
33+
list.add(sublist);
34+
}
35+
return list;
36+
}
37+
}

0 commit comments

Comments
 (0)