1
class Solution {
2
 public:
3
  vector<vector<int>> shiftGrid(vector<vector<int>> &grid, int k) {
4
    deque<int> dq;
5

6
    for (int i = 0; i < grid.size(); i++) {
7
      for (int j = 0; j < grid[i].size(); j++) {
8
        dq.push_back(grid[i][j]);
9
      }
10
    }
11

12
    int last = dq.size() - 1;
13
    while (k--) {
14
      int a = dq[last];
15
      dq.push_front(a);
16
      dq.pop_back();
17
    }
18

19
    int p = 0;
20

21
    for (int i = 0; i < grid.size(); i++) {
22
      for (int j = 0; j < grid[i].size(); j++) {
23
        grid[i][j] = dq[p];
24
        p++;
25
      }
26
    }
27

28
    return grid;
29
  }
30
};