class Solution {
public void rotate(int[][] matrix) {
for (int i = 0; i < matrix.length; i ++) {
for (int i1 = 0; i1 < matrix[0].length; i1 ++) {
if (i < i1) {
int tmp = matrix[i][i1];
matrix[i][i1] = matrix[i1][i];
matrix[i1][i] = tmp;
}
}
}
for (int i = 0; i < matrix.length; i ++) {
int j = 0, k = matrix[0].length - 1;
while (j < k) {
int tmp = matrix[i][j];
matrix[i][j] = matrix[i][k];
matrix[i][k] = tmp;
j ++;
k --;
}
}
}
}
02-28
1597
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-09
970
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
12-19
1万+
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
11-09
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交