Add files via upload

Author: assassint2017

Spiral Matrix II/Spiral_Matrix_II.py

@@ -0,0 +1,37 @@
+# 36ms 99.37%
+class Solution:
+    def generateMatrix(self, n):
+        """
+        :type n: int
+        :rtype: List[List[int]]
+        """
+        res_list = [[None for i in range(n)] for j in range(n)]
+        num = 1
+        
+        i_max, i_min, j_max, j_min = n - 1, 0, n - 1, 0
+        while True:
+            # 列从左向右
+            for j in range(j_min, j_max + 1, 1):
+                res_list[i_min][j] = num
+                num += 1
+            i_min += 1
+            if num == n ** 2 + 1:
+                break
+            # 行从上到下
+            for i in range(i_min, i_max + 1, 1):
+                res_list[i][j_max] = num
+                num += 1
+            j_max -= 1
+            # 列从右到左
+            for j in range(j_max, j_min - 1, -1):
+                res_list[i_max][j] = num
+                num += 1
+            i_max -= 1
+            if num == n ** 2 + 1:
+                break
+            # 行从下到上
+            for i in range(i_max, i_min - 1, -1):
+                res_list[i][j_min] = num
+                num += 1
+            j_min += 1
+        return res_list

Spiral Matrix/Spiral_Matrix.py

@@ -0,0 +1,32 @@
+# 32ms 100%
+class Solution:
+    def spiralOrder(self, matrix):
+        """
+        :type matrix: List[List[int]]
+        :rtype: List[int]
+        """
+        if not matrix:
+            return []
+        m, n = len(matrix), len(matrix[0])
+        i_max, i_min, j_max, j_min = m - 1, 0, n - 1, 0
+        res_list = []
+        while True:
+            # 列从左向右
+            res_list += matrix[i_min][j_min:j_max + 1]
+            i_min += 1
+            if len(res_list) == (m * n):
+                break
+            # 行从上到下
+            res_list += [matrix[i][j_max] for i in range(i_min, i_max + 1, 1)]
+            j_max -= 1
+            if len(res_list) == (m * n):
+                break
+            # 列从右到左
+            res_list += matrix[i_max][j_min:j_max + 1][::-1]
+            i_max -= 1
+            if len(res_list) == (m * n):
+                break
+            # 行从下到上
+            res_list += [matrix[i][j_min] for i in range(i_max, i_min - 1, -1)]
+            j_min += 1  
+        return res_list