1
class Solution {
2
public:
3
void rotate(vector<vector<int>> &matrix) {
4
int row = matrix.size();
5
for (int i = 0; i < row; i++) {
6
for (int j = 0; j <= i; j++) {
7
swap(matrix[i][j], matrix[j][i]);
8
}
9
}
10
for (int i = 0; i < row; i++) {
11
reverse(matrix[i].begin(), matrix[i].end());
12
}
13
}
14
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0