|
| 1 | +""" |
| 2 | +- ์์ชฝ ํ์ ์ํํ ํ, ์๋จ ๊ฒฝ๊ณ๋ฅผ 1 ์ฆ๊ฐ |
| 3 | +- ์ค๋ฅธ์ชฝ ์ด์ ์ํํ ํ, ์ฐ์ธก ๊ฒฝ๊ณ๋ฅผ 1 ๊ฐ์ |
| 4 | +- ์๋์ชฝ ํ์ ์ํํ ํ, ํ๋จ ๊ฒฝ๊ณ๋ฅผ 1 ๊ฐ์ |
| 5 | +- ์ผ์ชฝ ์ด์ ์ํํ ํ, ์ข์ธก ๊ฒฝ๊ณ๋ฅผ 1 ์ฆ๊ฐ |
| 6 | +
|
| 7 | +ํ์ถ ์กฐ๊ฑด |
| 8 | +1. ์์ชฝ ํ ์ํ๋ฅผ ๋ง์น๊ณ ์๋จ ์ธ๋ฑ์ค๊ฐ ํ๋จ ์ธ๋ฑ์ค๋ณด๋ค ์ปค์ง๋ฉด |
| 9 | +2. ์ค๋ฅธ์ชฝ ์ด ์ํ๋ฅผ ๋ง์น๊ณ , ์ฐ์ธก ์ธ๋ฑ์ค๊ฐ ์ข์ธก ์ธ๋ฑ์ค๋ณด๋ค ์์์ง๋ฉด |
| 10 | +
|
| 11 | +TC: O(m * n) => ํ๋ ฌ์ ์ ์ฅ๋ ๋ชจ๋ ์์๋ฅผ ๋ฑ 1๋ฒ์ฉ๋ง ์ ๊ทผ, SC: O(1) |
| 12 | +""" |
| 13 | + |
| 14 | +class Solution: |
| 15 | + def spiralOrder(self, matrix: List[List[int]]) -> List[int]: |
| 16 | + top, bottom = 0, len(matrix) - 1 # ํ์ ์ len(maxtrix) |
| 17 | + left, right = 0, len(matrix[0]) - 1 # ์ด์ ์ len(maxtrix[0]) |
| 18 | + |
| 19 | + output = [] |
| 20 | + |
| 21 | + while top <= bottom and left <= right: |
| 22 | + # ์์ชฝ ํ ์ํ |
| 23 | + for c in range(left, right + 1): |
| 24 | + output.append(matrix[top][c]) |
| 25 | + top += 1 |
| 26 | + |
| 27 | + if top > bottom: |
| 28 | + break |
| 29 | + |
| 30 | + # ์ค๋ฅธ์ชฝ ์ด ์ํ |
| 31 | + for r in range(top, bottom + 1): |
| 32 | + output.append(matrix[r][right]) |
| 33 | + right -= 1 |
| 34 | + |
| 35 | + if left > right: |
| 36 | + break |
| 37 | + |
| 38 | + # ์๋์ชฝ ํ ์ํ |
| 39 | + for c in range(right, left - 1, -1): |
| 40 | + output.append(matrix[bottom][c]) |
| 41 | + bottom -= 1 |
| 42 | + |
| 43 | + # ์ผ์ชฝ ์ด ์ํ |
| 44 | + for r in range(bottom, top - 1, -1): |
| 45 | + output.append(matrix[r][left]) |
| 46 | + left += 1 |
| 47 | + |
| 48 | + return output |
| 49 | + |
| 50 | +# 2๊ฐ์ ํฌ์ธํฐ๋ง ์ฌ์ฉํ๋ ํ์ด |
| 51 | +""" |
| 52 | +- ์์ชฝ ํ์ ์ํํ ํ, ์ด ์ธ๋ฑ์ค๋ฅผ 1์ฉ ์ฆ๊ฐ |
| 53 | +- ์ค๋ฅธ์ชฝ ์ด์ ์ํํ ํ, ํ ์ธ๋ฑ์ค๋ฅผ 1์ฉ ์ฆ๊ฐ |
| 54 | +- ์๋์ชฝ ํ์ ์ํํ ํ, ์ด ์ธ๋ฑ์ค๋ฅผ 1์ฉ ๊ฐ์ |
| 55 | +- ์ผ์ชฝ ์ด์ ์ํํ ํ, ํ ์ธ๋ฑ์ค๋ฅผ 1์ฉ ๊ฐ์ |
| 56 | +
|
| 57 | +์ธ๋ฑ์ค |
| 58 | +์์: (0, 0) => (ํ, ์ด) |
| 59 | +
|
| 60 | +ํ์ถ ์กฐ๊ฑด |
| 61 | +1. ์์ชฝ ํ ์ํ๋ฅผ ๋ง์น๊ณ ์๋จ ์ธ๋ฑ์ค๊ฐ ํ๋จ ์ธ๋ฑ์ค๋ณด๋ค ์ปค์ง๋ฉด |
| 62 | +2. ์ค๋ฅธ์ชฝ ์ด ์ํ๋ฅผ ๋ง์น๊ณ , ์ฐ์ธก ์ธ๋ฑ์ค๊ฐ ์ข์ธก ์ธ๋ฑ์ค๋ณด๋ค ์์์ง๋ฉด |
| 63 | +""" |
| 64 | + |
| 65 | +class Solution: |
| 66 | + def spiralOrder(self, matrix: List[List[int]]) -> List[int]: |
| 67 | + n_rows, n_cols = len(matrix), len(matrix[0]) |
| 68 | + row, col = 0, -1 |
| 69 | + direction = 1 |
| 70 | + |
| 71 | + output = [] |
| 72 | + |
| 73 | + # ๋จ์์๋ ์ด๊ณผ ํ์ ๊ฐ์๊ฐ 0 ๋ณด๋ค ํฐ ๋์ |
| 74 | + while 0 < n_rows and 0 < n_cols: |
| 75 | + for _ in range(n_cols): |
| 76 | + col += direction |
| 77 | + output.append(matrix[row][col]) |
| 78 | + n_rows -= 1 |
| 79 | + |
| 80 | + for _ in range(n_rows): |
| 81 | + row += direction |
| 82 | + output.append(matrix[row][col]) |
| 83 | + n_cols -= 1 |
| 84 | + |
| 85 | + direction *= -1 |
| 86 | + |
| 87 | + return output |
| 88 | + |
0 commit comments