Update: Leetcode 250207

docs/coding/leetcode/59.md

@@ -64,7 +64,7 @@ void change(int direction, int *i, int *j, int incre)
 int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
     *returnSize = n;
     *returnColumnSizes = (int *)malloc(sizeof(int) * n);
-    
+
     int i = 0, j = 0, m = 1, direction = 0, **ret = (int **)malloc(sizeof(int *) * n);
     for (i = 0; i < n; i++)
     {
@@ -90,3 +90,22 @@ int** generateMatrix(int n, int* returnSize, int** returnColumnSizes){
     return ret;
 }
 ```
+
+```python
+class Solution:
+    def generateMatrix(self, n: int) -> List[List[int]]:
+        result = [[0] * n for _ in range(n)]
+        i, j, step, total = 0, 0, 2, n * n
+        directions = [(0, 1), (1, 0), (0, -1), (-1, 0)] * n
+        result[i][j] = 1
+        for d_i, d_j in directions:
+            i, j = i + d_i, j + d_j
+            while i >= 0 and i < n and j >= 0 and j < n:
+                if result[i][j]:
+                    break
+                result[i][j] = step
+                step += 1
+                i, j = i + d_i, j + d_j
+            i, j = i - d_i, j - d_j
+        return result
+```