diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/1914. Cyclically Rotating a Grid" "b/leetcode3/\354\206\241\354\243\274\355\230\234/1914. Cyclically Rotating a Grid" new file mode 100644 index 00000000..7b290f92 --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/1914. Cyclically Rotating a Grid" @@ -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 + + +/** +수정해야함 +**/ diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/copy" "b/leetcode3/\354\206\241\354\243\274\355\230\234/copy" new file mode 100644 index 00000000..917c84d4 --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/copy" @@ -0,0 +1,13 @@ +# + +''' +1. 아이디어 : + + +2. 시간복잡도 : + O() + +3. 자료구조/알고리즘 : + + +'''