Looking at the input matrix and the output matrix,
we can easily find that it rotates 90° clockwise.
And I implement that by rotating every "circle" of it.
First I rotate the outmost circle,
then to the inside,
still to the inside,
until there's no more circle.
The Runtime of the program is 3 ms.
The length of the code is 509 Bytes.
void rotate(int** matrix, int matrixRowSize, int matrixColSize) {
int i,j,tmp;
for (j=0; j<matrixRowSize/2; j++) {
for (i=0; i<matrixRowSize-2*j-1; i++) {
tmp=matrix[j][i+j];
matrix[j][i+j]=matrix[matrixRowSize-i-j-1][j];
matrix[matrixRowSize-i-j-1][j]=matrix[matrixRowSize-j-1][matrixColSize-i-j-1];
matrix[matrixRowSize-j-1][matrixColSize-i-j-1]=matrix[i+j][matrixColSize-j-1];
matrix[i+j][matrixColSize-j-1]=tmp;
}
}
}