class Solution {
public:
    void rotate(vector<vector<int> > &matrix) {
        int n = matrix.size();
        for (int i = 0; i < n; ++i) {
            for (int j = i + 1; j < n; ++j) {
                swap(matrix[i][j], matrix[j][i]);
            }
            reverse(matrix[i].begin(), matrix[i].end());
        }
    }
};

相关文章:

  • 2022-01-05
  • 2022-01-04
  • 2021-09-07
  • 2021-11-19
  • 2021-09-27
  • 2022-01-01
猜你喜欢
  • 2021-04-18
相关资源
相似解决方案