【Leetcode】数组-48. 旋转图像
题目
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/7ba63efbd3621179c457cf93ab8e6155.png)
思路
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/501cefcc556146a905d312b2ec2fa3c4.png)
代码
class Solution {
public void rotate(int[][] matrix) {
for(int i = 0; i < matrix.length; i++){
for(int j = i + 1; j < matrix[0].length; j++)
{
int t = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = t;
}
}
if(matrix[0].length % 2 == 0){
for(int ii = 0; ii < matrix.length; ii++){
for(int k = 0; k < matrix[0].length / 2; k++){
int temp = matrix[ii][k];
matrix[ii][k] = matrix[ii][matrix[0].length - 1 - k];
matrix[ii][matrix[0].length - 1 - k] = temp;
}
}
}else{
for(int jj = 0; jj < matrix.length;jj++){
for(int kk = 0; kk < matrix[0].length / 2; kk++){
int temp = matrix[jj][kk];
matrix[jj][kk] = matrix[jj][matrix[0].length - 1 - kk];
matrix[jj][matrix[0].length - 1 - kk] = temp;
}
}
}
}
}