1260. Shift 2D Grid
https://leetcode.com/problems/shift-2d-grid
Description
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 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 shift operation k
times.
Example 1:
Example 2:
Example 3:
Constraints:
m == grid.length
n == grid[i].length
1 <= m <= 50
1 <= n <= 50
-1000 <= grid[i][j] <= 1000
0 <= k <= 100
ac
Last updated