题目链接:https://leetcode.cn/problems/rotate-image/description/?envType=study-plan-v2&envId=top-100-liked
模拟
随机找几个样例,找规律
class Solution {
public void rotate(int[][] matrix) {
int n = matrix.length;
int m = matrix[0].length;
//当n为奇数时,n + 1使得中间那个元素也能被交换
for(int i = 0; i < (n + 1) / 2; i++){
for(int j = 0; j < m / 2; j++){
int t = matrix[i][j];
matrix[i][j] = matrix[n - j - 1][i];
matrix[n - j - 1][i] = matrix[m - i - 1][n - j - 1];
matrix[m - i - 1][n - j - 1] = matrix[j][m - i - 1];
matrix[j][m - i - 1] = t;
}
}
}
}
还剩80题!