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]
]
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
/* 注意是inplace 想法:
* 先求对称矩阵 即交换 m[i][j] 和 m[j][i]的值
* 然后每一行原地reverse
*
* 优化后: 转上三角优先 这样在处理当前行完毕后即可进行转置
* 1 2 3 1 4 7 7 4 1
* 4 5 6 2 5
* 7 8 9 3 9
* */
int len=matrix.size();
for(int i=0;i<len;i++){
for(int j=i+1;j<len;j++){
swap(matrix[i][j], matrix[j][i]);
}
reverse(matrix[i].begin(), matrix[i].end());
}
}
};