题目:
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?
思路:
将matrix中的结点考虑为空间向量。顺时针转动90度就是每个向量转动。向量转动的公式如下,并且出下图的坐标中我们可以发现,转动后的向量坐标超出了该矩阵的范围,于是我们需要平移n-1个距离来定位到原来的矩阵。代码:
class Solution {
public:
void rotate(vector<vector<int> > &matrix) {
if(matrix.size() <= 1)
return;
int n = matrix.size();
for(int i=0;i<n/2;i++)
{
for(int j=i;j<n-1-i;j++)
{
int x=i;
int y=j;
int val = matrix[x][y];
matrix[x][y] = matrix[-1*y+n-1][x];
matrix[-1*y+n-1][x] = matrix[-1*x+n-1][-1*y+n-1];
matrix[-1*x+n-1][-1*y+n-1] = matrix[y][-1*x+n-1];
matrix[y][-1*x+n-1] = val;
}
}
}
};