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

Commiteb460a4

Browse files
refactor 103
1 parenta214676 commiteb460a4

File tree

1 file changed

+10
-13
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+10
-13
lines changed

‎src/main/java/com/fishercoder/solutions/_103.java

Lines changed: 10 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -11,34 +11,31 @@
1111
publicclass_103 {
1212
publicstaticclassSolution1 {
1313
publicList<List<Integer>>zigzagLevelOrder(TreeNoderoot) {
14-
Queue<TreeNode>q =newLinkedList();
14+
Queue<TreeNode>queue =newLinkedList();
1515
List<List<Integer>>levels =newArrayList();
1616
if (root ==null) {
1717
returnlevels;
1818
}
19-
q.offer(root);
19+
queue.offer(root);
2020
booleanforward =true;
21-
while (!q.isEmpty()) {
22-
intsize =q.size();
21+
while (!queue.isEmpty()) {
22+
intsize =queue.size();
2323
List<Integer>level =newArrayList();
2424
for (inti =0;i <size;i++) {
25-
TreeNodecurr =q.poll();
25+
TreeNodecurr =queue.poll();
2626
level.add(curr.val);
2727
if (curr.left !=null) {
28-
q.offer(curr.left);
28+
queue.offer(curr.left);
2929
}
3030
if (curr.right !=null) {
31-
q.offer(curr.right);
31+
queue.offer(curr.right);
3232
}
3333
}
34-
if (forward) {
35-
forward =false;
36-
levels.add(level);
37-
}else {
34+
if (!forward) {
3835
Collections.reverse(level);
39-
levels.add(level);
40-
forward =true;
4136
}
37+
forward = !forward;
38+
levels.add(level);
4239
}
4340
returnlevels;
4441
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp