leetcode 48. Rotate Image

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 1:

Given input matrix =
[
[1,2,3],
[4,5,6],
[7,8,9]
],

rotate the input matrix in-place such that it becomes:
[
[7,4,1],
[8,5,2],
[9,6,3]
]

Example 2:

Given input matrix =
[
[ 5, 1, 9,11],
[ 2, 4, 8,10],
[13, 3, 6, 7],
[15,14,12,16]
],

rotate the input matrix in-place such that it becomes:
[
[15,13, 2, 5],
[14, 3, 4, 1],
[12, 6, 8, 9],
[16, 7,10,11]
]

tag: array

method 1

规律：先根据斜对称轴交换，再根据y对称轴交换

public void rotate(int[][] matrix) {
    int n = matrix.length;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= i; j++) {
            int tmp = matrix[i][j];
            matrix[i][j] = matrix[j][i];
            matrix[j][i] = tmp;
        }
    }

    int mid = matrix.length/2;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < mid; j++) {
            int tmp = matrix[i][j];
            int symmetricalY = n-1-j;
            matrix[i][j] = matrix[i][symmetricalY];
            matrix[i][symmetricalY] = tmp;
        }
    }

}

summary:

1. summary:之前就找到了规律了，先根据斜对称轴对折，再根据中线y轴对折，但是想的太复杂，想一口气弄完两次对折，应该像这样，一次一次弄，分别弄开