We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1b156d9 commit d39daa8Copy full SHA for d39daa8
2018.12.06-leetcode103/Sunny.md
@@ -0,0 +1,25 @@
1
+```java
2
+class Solution {
3
+ List<List<Integer>> result = new ArrayList<>();
4
+ public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
5
+ zigzagLevelOrder(root, 0, false);
6
+ return result;
7
+ }
8
+
9
+ public void zigzagLevelOrder(TreeNode node, int level, boolean inverse) {
10
+ if (node != null) {
11
+ if (result.size() <= level) {
12
+ result.add(new ArrayList<>());
13
14
+ if (inverse) {
15
+ result.get(level).add(0, node.val);
16
17
+ else {
18
+ result.get(level).add(node.val);
19
20
+ zigzagLevelOrder(node.left, level+1, !inverse);
21
+ zigzagLevelOrder(node.right, level+1, !inverse);
22
23
24
+}
25
+```
0 commit comments