class Solution {

public void rotate(int[][] matrix) {

int length = matrix[0].length;

int index = 0;

if (length > 1) {

while (length / 2 >= index + 1) {

int maxLength = length - 2 * index;

for (int j = 0; j < maxLength - 1; j++) {

int temp = matrix[index][j + index];

matrix[index][j + index] = matrix[maxLength - 1 - j + index][index];

matrix[maxLength - 1 - j + index][index] = matrix[maxLength - 1 + index][maxLength - 1 - j + index];

matrix[maxLength - 1 + index][maxLength - 1 - j + index] = matrix[j + index][maxLength - 1 + index];

matrix[j + index][maxLength - 1 + index] = temp;

}

index++;

}

}

}

}