Merge pull request gzc426#316 from Scottnan/master

gzc426 · web-flow · commit 0a93f1795d54 · 2018-12-05T13:04:01.000+08:00
Create Despacito.md
diff --git a/2018.12.05-leetcode102/Despacito.md b/2018.12.05-leetcode102/Despacito.md
@@ -0,0 +1,57 @@
+# leetcode 102 Binary Tree Level Order Traversal
+## 1. Description
+Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
+
+For example:
+Given binary tree [3,9,20,null,null,15,7],
+
+            3
+           / \
+          9  20
+             / \
+            15  7
+            
+ return its level order traversal as:
+```python
+[
+  [3],
+  [9, 20],
+  [15, 7] 
+]
+```
+
+## 2. Solution
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def levelOrder(self, root):
+        """
+        :type root: TreeNode
+        :rtype: List[List[int]]
+        """
+        if not root:
+            return []
+        l = [root, '#']
+        result = []
+        level = []
+        while len(l) > 1:
+            curr = l.pop(0)
+            if curr != '#':
+                level.append(curr.val)
+                if curr.left:
+                    l.append(curr.left)
+                if curr.right:
+                    l.append(curr.right)
+            else:
+                l.append('#')
+                result.append(level)
+                level = []
+        result.append(level)
+        return result
+```
diff --git a/2018.12.06-leetcode103/Despacito.md b/2018.12.06-leetcode103/Despacito.md
@@ -0,0 +1,61 @@
+# LeetCode 103 Binary Tree Zigzag Level Order Traversal
+## 1. Description
+Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
+
+For example:
+Given binary tree [3,9,20,null,null,15,7],
+
+        3
+       / \
+      9  20
+         / \
+        15  7
+
+return its zigzag level order traversal as:
+```python
+[
+  [3],
+  [20,9],
+  [15,7]
+]
+```
+## 2. Solution
+```python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, x):
+#         self.val = x
+#         self.left = None
+#         self.right = None
+
+class Solution:
+    def zigzagLevelOrder(self, root):
+        """
+        :type root: TreeNode
+        :rtype: List[List[int]]
+        """
+        if not root:
+            return []
+        l = [root, '#']
+        result = []
+        level = []
+        flag = 1
+        while len(l) > 1:
+            curr = l.pop(0)
+            if curr != '#':
+                if flag == 1:
+                    level.append(curr.val)
+                else:
+                    level.insert(0, curr.val)
+                if curr.left:
+                    l.append(curr.left)
+                if curr.right:
+                    l.append(curr.right)
+            else:
+                l.append('#')
+                result.append(level)
+                level = []
+                flag *= -1
+        result.append(level)
+        return result
+```
