leetcode -- 48. Rotate Image

题目描述

题目难度：Medium
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]
]

AC代码

先将2维数组按照副对角线对称，然后将数组上下翻折。

class Solution {
    public void rotate(int[][] matrix) {
        symmetry(matrix); //将2维数组按照副对角线对称
        upDownRotate(matrix); // 然后将数组上下翻折。
    }
    
    private void symmetry(int[][] matrix){
        int len = matrix.length;
        int d = len - 1;
        for(int i = 0;i < len - 1;i++){
            for(int j = 0;j < d;j++){
                int tmp = matrix[i][j];
                matrix[i][j] = matrix[len - j - 1][len - i - 1];
                matrix[len - j - 1][len - 1 - i] = tmp;
            }
            d--;
        }
    }
    
    private void upDownRotate(int[][] matrix){
        int len = matrix.length;
        for(int i = 0;i < len / 2;i++){
            for(int j = 0;j < len;j++){
                int tmp = matrix[i][j];
                matrix[i][j] = matrix[len - i - 1][j];
                matrix[len - i - 1][j] = tmp;
            }
        }
    }
}