Leetcode 48. Rotate Image[medium][java]

You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).

Note:
You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.
Example

Solution 1
Consideration

1. We firstly reverse the matrix by its anti-diagonal
2. Secondly, reverse the matrix again along the middle horizontal line

class Solution {
    public void rotate(int[][] matrix) {
        if(matrix == null)
            return;
        int n = matrix[0].length;
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n-1-i; j++) {
                int temp = matrix[i][j];
                matrix[i][j] = matrix[n-1-j][n-1-i];
                matrix[n-1-j][n-1-i] = temp;
            }
        
        for(int i = 0; i < n/2; i++) 
            for(int j = 0; j < n; j++){
                int temp = matrix[i][j];
                matrix[i][j] = matrix[n-1-i][j];
                matrix[n-1-i][j] = temp;
            }
    }
}

Solution 2
**Consideration **

1. From outer circle to inner circle, reverse each circle.
2. I.e. A[i][j] -> A[j][n-1-i] -> A[n-1-i][n-1-j] -> A[n-1-j][i] -> A[i][j]
3. very easy to get confused

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for(int layer = 0; layer < n/2; layer++) {
            int start = layer;
            int end = n-1-layer;
            for(int i = start; i < end; i++){
                int offset = i-start;
                int temp = matrix[start][i];
                // left to top;
				matrix[start][i] = matrix[end - offset][start];
				// bottom to left;
				matrix[end - offset][start] = matrix[end][end-offset];
				// right to bottm;
				matrix[end][end-offset] = matrix[i][end];
				// top to right;
			    matrix[i][end] = temp;
            }
        }
    }
}

References
4. https://blog.csdn.net/mine_song/article/details/69939062