#1260
Shift 2D Grid
pupil · 320 · lc easy +21 · verified · 68% accepted · 1,792 likes · top 75%
Description
You are given an m x n 2D grid and a non-negative integer k. Apply k shift operations to the grid.
In a single shift:
- Each element at grid[i][j] moves to grid[i][j + 1].
- Each element at grid[i][n - 1] (rightmost in a row) moves to grid[i + 1][0].
- The element at grid[m - 1][n - 1] (bottom-right) wraps around to grid[0][0].
Return the resulting grid after all k shifts.
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]]
Code
1
2
3