LeetCode-Py/LeetCode/_0051_0100/_059_SpiralMatrix2.py at master · BigEggStudy/LeetCode-Py · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#-----------------------------------------------------------------------------
# Runtime: 36ms
# Memory Usage:
# Link:
#-----------------------------------------------------------------------------

class Solution:
    def generateMatrix(self, n: int) -> [[int]]:
        total_count = n * n
        current_num = 1
        result = [[0] * n for _ in range(n)]

        level = 0
        while True:
            first_row = level
            first_col = level
            last_row = n - level - 1
            last_col = n - level - 1

            for i in range(first_col, last_col + 1):
                result[first_row][i] = current_num
                current_num += 1
            if current_num > total_count:
                break

            for i in range(first_row + 1, last_row):
                result[i][last_col] = current_num
                current_num += 1
            if current_num > total_count:
                break

            for i in range(last_col, first_col - 1, -1):
                result[last_row][i] = current_num
                current_num += 1
            if current_num > total_count:
                break

            for i in range(last_row - 1, first_row, -1):
                result[i][first_col] = current_num
                current_num += 1
            if current_num > total_count:
                break

            level += 1

        return result