-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathLeetCode103.java
More file actions
36 lines (34 loc) · 1.02 KB
/
LeetCode103.java
File metadata and controls
36 lines (34 loc) · 1.02 KB
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
package problems;
import java.util.*;
public class LeetCode103 {
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null) {
return res;
}
Queue<TreeNode> queue = new ArrayDeque<>();
queue.add(root);
boolean isOrderLeft = true;
while (!queue.isEmpty()) {
List<Integer> ans = new ArrayList<>();
int size = queue.size();
while (size -- > 0) {
TreeNode node = queue.poll();
if(isOrderLeft) {
ans.add(node.val);
} else {
ans.add(0, node.val);
}
if(node.left != null) {
queue.add(node.left);
}
if(node.right != null) {
queue.add(node.right);
}
}
isOrderLeft = !isOrderLeft;
res.add(ans);
}
return res;
}
}