Merge pull request gzc426#329 from Jerring/master

gzc426 · web-flow · commit e1ebc1301e9a · 2018-12-06T22:07:21.000+08:00
Create TheRocket.md
diff --git a/2018.12.05-leetcode102/TheRocket.md b/2018.12.05-leetcode102/TheRocket.md
@@ -0,0 +1,36 @@
+```java
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public List<List<Integer>> levelOrder(TreeNode root) {
+        List<List<Integer>> res = new LinkedList<>();
+        Queue<TreeNode> queue = new LinkedList<>();
+        if (root != null) {
+            queue.offer(root);
+        }
+        while (!queue.isEmpty()) {
+            int size = queue.size();
+            List<Integer> level = new LinkedList<>();
+            while (size-- != 0) {
+                TreeNode node = queue.poll();
+                level.add(node.val);
+                if (node.left != null) {
+                    queue.offer(node.left);
+                }
+                if (node.right != null) {
+                    queue.offer(node.right);
+                }
+            }
+            res.add(level);
+        }
+        return res;
+    }
+}
+```
diff --git a/2018.12.06-leetcode103/TheRocket.md b/2018.12.06-leetcode103/TheRocket.md
@@ -0,0 +1,42 @@
+```java
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public List<List<Integer>> zigzagLevelOrder(TreeNode root) {
+        List<List<Integer>> res = new LinkedList<>();
+        Queue<TreeNode> queue = new LinkedList<>();
+        if (root != null) {
+            queue.offer(root);
+        }
+        boolean leftToRight = true;
+        while (!queue.isEmpty()) {
+            int size = queue.size();
+            LinkedList<Integer> level = new LinkedList<>();
+            while (size-- != 0) {
+                TreeNode node = queue.poll();
+                if (leftToRight) {
+                    level.offerLast(node.val); 
+                } else {
+                    level.offerFirst(node.val); 
+                }
+                if (node.left != null) {
+                    queue.offer(node.left);
+                }
+                if (node.right != null) {
+                    queue.offer(node.right);
+                }
+            }
+            res.add(level);
+            leftToRight = !leftToRight;
+        }
+        return res;
+    }
+}
+```
