简单数学题
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int itera=1;
int length=matrix.size();
//1
while(length>1)
{
int firstIndex=itera;
int secondIndex=firstIndex;
int firstStep=0;
int secondStep=length-1;
for(int i=0;i<length-1;i++)
{
int temp=matrix[firstIndex-1][secondIndex-1];
matrix[firstIndex-1][secondIndex-1]= matrix[firstIndex+secondStep-1][secondIndex-firstStep-1];
matrix[firstIndex+secondStep-1][secondIndex-firstStep-1]= matrix[firstIndex+firstStep+secondStep-1][secondIndex-firstStep+secondStep-1];
matrix[firstIndex+firstStep+secondStep-1][secondIndex-firstStep+secondStep-1]=matrix[firstIndex+firstStep-1][secondIndex+secondStep-1];
matrix[firstIndex+firstStep-1][secondIndex+secondStep-1]=temp;
secondIndex++;
firstStep++;
secondStep--;
}
//2
itera++;
length-=2;
}
}
};