13:T457,class Solution { public int[][] rotateGrid(int[][] grid, int k) { int m = grid.length, n = grid[0].length; int nlayer = Math.min(m / 2, n / 2); for (int layer = 0; layer < nlayer; ++layer) { List r = new ArrayList<>(); List c = new ArrayList<>(); List val = new ArrayList<>(); for (int i = layer; i < m - layer - 1; ++i) { r.add(i); c.add(layer); val.add(grid[i][layer]); } for (int j = layer; j < n - layer - 1; ++j) { r.add(m - layer - 1); c.add(j); val.add(grid[m - layer - 1][j]); } for (int i = m - layer - 1; i > layer; --i) { r.add(i); c.add(n - layer - 1); val.add(grid[i][n - layer - 1]); } for (int j = n - layer - 1; j > layer; --j) { r.add(layer); c.add(j); val.add(grid[layer][j]); } int total = val.size(); int kk = k % total; for (int i = 0; i < total; ++i) { int idx = (i - kk + total) % total; grid[r.get(i)][c.get(i)] = val.get(idx); } } return grid; } }14:T437,class Solution { public: vector> rotateGrid(vector>& grid, int k) { int m = grid.size(), n = grid[0].size(); int nlayer = min(m / 2, n / 2); for (int layer = 0; layer < nlayer; ++layer) { vector r, c, val; for (int i = layer; i < m - layer - 1; ++i) { r.push_back(i); c.push_back(layer); val.push_back(grid[i][layer]); } for (int j = layer; j < n - layer - 1; ++j) { r.push_back(m - layer - 1); c.push_back(j); val.push_back(grid[m - layer - 1][j]); } for (int i = m - layer - 1; i > layer; --i) { r.push_back(i); c.push_back(n - layer - 1); val.push_back(grid[i][n - layer - 1]); } for (int j = n - layer - 1; j > layer; --j) { r.push_back(layer); c.push_back(j); val.push_back(grid[layer][j]); } int total = val.size(); int kk = k % total; for (int i = 0; i < total; ++i) { int idx = (i - kk + total) % total; grid[r[i]][c[i]] = val[idx]; } } return grid; } };

Time Complexity

Space Complexity