-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
46 lines (42 loc) · 1.26 KB
/
Main.java
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
43
44
45
46
package com.company;
import java.lang.reflect.Array;
import java.util.*;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
String s = "";
s.c
}
public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
List<List<Integer>> res = new ArrayList<>();
if(root == null) return res;
boolean reverse = false;
ArrayDeque<TreeNode> queue = new ArrayDeque<>(){{offer(root);}};
while (!queue.isEmpty()){
int count = queue.size();
List<Integer> temp = new ArrayList<>();
for (int i = 0; i < count; i++) {
TreeNode cur = queue.poll();
temp.add(cur.val);
if(cur.left != null) queue.offer(cur.left);
if(cur.right != null) queue.offer(cur.right);
}
if(reverse) Collections.reverse(temp);
res.add(temp);
reverse = !reverse;
}
return res;
}
}