You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Follow up:
Could you do this in-place?
先按斜对角线翻转,再上下翻转。
实现代码:
class Solution {
public:
void rotate(vector<vector<int> > &matrix) {
int n = matrix.size();
if(n <= 1) return ;
for(int i = 0 ; i < n ; i++) {
for(int j = 0 ; j < n - i; j++) {
swap(matrix[i][j] , matrix[n-1-j][n-1-i]);
}
}
for(int i = 0 ; i < n / 2 ; i++) {
for(int j = 0 ; j < n ; j++) {
swap(matrix[i][j] , matrix[n-i-1][j]);
}
}
}
};
或者按照90度旋转规律直接交换元素。
public class Solution {
public void rotate(int[][] matrix) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
return;
}
int length = matrix.length;
for (int i = 0; i < length / 2; i++) {
for (int j = 0; j < (length + 1) / 2; j++){
int tmp = matrix[i][j];
matrix[i][j] = matrix[length - j - 1][i];
matrix[length -j - 1][i] = matrix[length - i - 1][length - j - 1];
matrix[length - i - 1][length - j - 1] = matrix[j][length - i - 1];
matrix[j][length - i - 1] = tmp;
}
}
}
}