Movatterモバイル変換


[0]ホーム

URL:


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

Commit10d5681

Browse files
committed
Create 0103-binary-tree-zigzag-level-order-traversal.java
1 parent3d6e86e commit10d5681

File tree

1 file changed

+30
-0
lines changed

1 file changed

+30
-0
lines changed
Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
classSolution {
2+
booleanreverse =false;// flag to detrmine the direction left or right
3+
List<List<Integer>>sol =newArrayList<List<Integer>>();
4+
publicList<List<Integer>>zigzagLevelOrder(TreeNoderoot) {
5+
if(root ==null){returnsol;}
6+
Queue<TreeNode>queue =newLinkedList<>();
7+
queue.add(root);
8+
while( !queue.isEmpty()){
9+
List<Integer>temp =newArrayList<Integer>();
10+
intsize =queue.size();
11+
for(inti=0;i <size;i++){
12+
TreeNodenode =queue.poll();
13+
temp.add(node.val);
14+
if(node.left !=null){
15+
queue.add(node.left);
16+
}
17+
if(node.right !=null){
18+
queue.add(node.right);
19+
}
20+
}
21+
if(reverse){
22+
Collections.reverse(temp);
23+
}
24+
reverse = !reverse;
25+
sol.add(temp);
26+
}
27+
returnsol;
28+
}
29+
30+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp