Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 28 additions & 0 deletions leetcode3/송주혜/1914. Cyclically Rotating a Grid
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
class Solution:
def rotateGrid(self, grid: List[List[int]], k: int) -> List[List[int]]:
m = len(grid)
n = len(grid[0])

minLen = min(m, n)

for i in range(minLen //2):
for j in range(k): # k만큼 돌기
tmp = grid[i][i]

for k in range(i, n-1): # <-
grid[i][k] = grid[i][k+1]
for k in range(i, m-1): # ^
grid[k][n-1] = grid[k+1][n-1]
for k in range(n-1, i, -1): # ->
grid[m-1][k] = grid[m-1][k-1]
for k in range(m-1, i, -1):
grid[k][i] = grid[k-1][i]

grid[i+1][i] = tmp

return grid


/**
수정해야함
**/
13 changes: 13 additions & 0 deletions leetcode3/송주혜/copy
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
#

'''
1. 아이디어 :


2. 시간복잡도 :
O()

3. 자료구조/알고리즘 :


'''
Loading