1260. Shift 2D Grid

發表於 | 分類於

problem

solution

option 1

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) {
        vector<int> vec;
        int n =grid.size(), m=grid[0].size();
        for(int i=0;i<n;++i){
            for(int j = 0;j<m;++j){
                vec.push_back(grid[i][j]);
            }
        }
        k%= m*n;
        k = m*n-k;
        for(int i=0;i<n;++i){
            for(int j = 0;j<m;++j){
                grid[i][j] = vec[k%(m*n)];
                k++;
            }
        }
        return grid;
    }
};

option 2 - O(1)

analysis

  • time complexity O(mn)
  • space complexity O(nm) O(1)