-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #4 from 149ps/main
Main
- Loading branch information
Showing
2 changed files
with
53 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,47 @@ | ||
""" | ||
Given a 2D grid of size m x n and an integer k. You need to shift the grid k times. | ||
In one shift operation: | ||
Element at grid[i][j] moves to grid[i][j + 1]. | ||
Element at grid[i][n - 1] moves to grid[i + 1][0]. | ||
Element at grid[m - 1][n - 1] moves to grid[0][0]. | ||
Return the 2D grid after applying shift operation k times. | ||
Example 1: | ||
Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1 | ||
Output: [[9,1,2],[3,4,5],[6,7,8]] | ||
Example 2: | ||
Input: grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4 | ||
Output: [[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]] | ||
Example 3: | ||
Input: grid = [[1,2,3],[4,5,6],[7,8,9]], k = 9 | ||
Output: [[1,2,3],[4,5,6],[7,8,9]] | ||
Constraints: | ||
m == grid.length | ||
n == grid[i].length | ||
1 <= m <= 50 | ||
1 <= n <= 50 | ||
-1000 <= grid[i][j] <= 1000 | ||
0 <= k <= 100 | ||
""" | ||
class Solution: | ||
def shiftGrid(self, grid: List[List[int]], k: int) -> List[List[int]]: | ||
m,n = len(grid), len(grid[0]) | ||
k = k % (m*n) | ||
temp = [grid[i][j] for i in range(m) for j in range(n)] | ||
temp = temp[-k:] + temp[:-k] | ||
result = [] | ||
for i in range(m): | ||
result.append(temp[i*n:i*n+n]) | ||
return result |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters