class Solution {
public:
vector<vector<int>> rotate(vector<vector<int>>& matrix) {
int size = matrix.size();
for (int time = 0; time <= size / 2; time++) {
int len = size - 2 * time;
for (int i = 0; i < len-1; i++) {
int tem = matrix[time][time + i];
matrix[time][time + i] = matrix[time + len - 1 - i][time];//对边1的点操作
matrix[time + len - i - 1][time] = matrix[time + len - 1][time + len - i - 1];//对边2的点操作
matrix[time + len - 1][time + len - i - 1] = matrix[time + i][time + len - 1];//对边3的点操作
matrix[time + i][time + len - 1] = tem;//对边4的点操作
}
}
return matrix;
}
};
代码中写的边对应如下