矩阵旋转算法(该算法不需要创建额外的二维数组)
public void rotate(int[][] matrix)
{
int length= matrix[0].length;
int index= 0;
for(int i=0;i<length/2;i++)
{
for(int j=index;j<length-index-1;j++)
{
int temp1= matrix[i][j];
matrix[i][j]= matrix[length-j-1][i];
int temp2= matrix[j][length-i-1];
matrix[j][length-i-1]= temp1;
int temp3= matrix[length-i-1][length-j-1];
matrix[length-i-1][length-j-1]= temp2;
matrix[length-j-1][i]= temp3;
}
index++;
}
}