목록Shift 2D Grid (1)
kohigowild
221114 :: [leetcode] Shift 2D Grid, Add Digits, Append K Integers With Minimal Sum
Shift 2D Grid 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: [[..
Algorithm
2022. 11. 14. 15:00