Shift 2D Grid
Given a 2D grid of size m x n and an integer k, shift the grid k times.
In one shift operation:
- Element at
grid[i][j]moves togrid[i][j + 1]. - Element at
grid[i][n - 1]moves togrid[i + 1][0]. - Element at
grid[m - 1][n - 1]moves togrid[0][0].
Return the 2D grid after applying the shift operation k times.
Example 1
1 2 3 4 5 6 7 8 9
Input
grid = [[1,2,3],[4,5,6],[7,8,9]], k = 1Output
[[9,1,2],[3,4,5],[6,7,8]]After one shift, every element moves one position to the right in row-major order, and the last element wraps to the first position.
Example 2
3 8 1 9 19 7 2 5 4 6 11 10 12 0 21 13
Input
grid = [[3,8,1,9],[19,7,2,5],[4,6,11,10],[12,0,21,13]], k = 4Output
[[12,0,21,13],[3,8,1,9],[19,7,2,5],[4,6,11,10]]After four shifts, the last row wraps around to become the first row.
Constraints
- m == grid.length
- n == grid[i].length
- 1 <= m <= 50
- 1 <= n <= 50
- -1000 <= grid[i][j] <= 1000
- 0 <= k <= 100