You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Note:
You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
Example 1:
Given input matrix = [ [1,2,3], [4,5,6], [7,8,9] ], rotate the input matrix in-place such that it becomes: [ [7,4,1], [8,5,2], [9,6,3] ]
Example 2:
Given input matrix = [ [ 5, 1, 9,11], [ 2, 4, 8,10], [13, 3, 6, 7], [15,14,12,16] ], rotate the input matrix in-place such that it becomes: [ [15,13, 2, 5], [14, 3, 4, 1], [12, 6, 8, 9], [16, 7,10,11] ]
题目给出的意思是给出一个N*N的矩阵(图片),然后将其顺时针旋转90°输出。问题不大:
class Solution {
public:
void rotate(vector<vector<int> > &matrix) {
int n = matrix.size();
int temp = 0;
int i = 0, j = 0;
int start = 0, end = n-1;
int index = 0;
int width = 0;
width = n-1;
while(start < end) {
for(j = start; j < end; j++) {
temp = matrix[index][j];
matrix[index][j] = matrix[width-j][index];
matrix[width-j][index] = matrix[width-index][width-j];
matrix[width-index][width-j] = matrix[j][width-index];
matrix[j][width-index] = temp;
}
index++;
start++;
end--;
}
}
};
具体思路其实就是一圈一圈的往里面旋转,先旋转外面的,再旋转里面的,最后输出即可。