旋转矩阵（leetcode4.7每日打卡）

 1 void rotate(int** matrix, int matrixSize, int* matrixColSize)
 2 {
 3     int matrix_new[matrixSize][matrixColSize[0]];
 4 
 5     for(int i = 0; i < matrixSize; i++)
 6     {
 7         for(int j = 0; j < matrixColSize[i]; j++)
 8         {
 9             matrix_new[j][matrixSize - i - 1] = matrix[i][j];
10         }
11     }
12 
13     for(int i = 0; i < matrixSize; i++)
14     {
15         for(int j = 0; j < matrixColSize[i]; j++)
16         {
17             matrix[i][j] = matrix_new[i][j];
18         }
19     }
20 }

 1 for (int i = 0; i < 2; i++)
 2     {
 3         for (int j = 1; j < 3; j++)
 4         {
 5             int temp = a[i][j];
 6             a[i][j] = a[j][i];
 7             a[j][i] = temp;
 8 
 9         }
10     }

 1 void rotate(int** matrix, int matrixSize, int* matrixColSize)
 2 {
 3     for(int i = 0; i < matrixSize-1; i++)
 4     {
 5         for(int j = i+1; j < matrixSize; j++)
 6         {
 7             int temp = matrix[i][j];
 8             matrix[i][j] = matrix[j][i];
 9             matrix[j][i] = temp;
10         }
11     }
12 
13     int mid = matrixSize/2;
14     for(int i = 0; i < matrixSize; i++)
15     {
16         for(int j = 0; j < mid; j++)
17         {
18             int temp = matrix[i][j];
19             matrix[i][j] = matrix[i][matrixSize-1-j];
20             matrix[i][matrixSize-1-j] = temp;
21         }
22     }
23 }