LeetCode 48. Rotate Image 旋转图像（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 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]
]

解答：

题目要求将一个 n x n 的矩阵顺时针旋转90°，解法并不难，找到对应的规律即可。
可以发现，将矩阵顺时针旋转90°，可通过两步实现：

1. 将矩阵沿行，上下对称交换
2. 将矩阵沿对角线对称交换

  [ 5, 1, 9, 11],					[15, 14, 12, 16],				[15,13, 2, 5],
  [ 2, 4, 8, 10],	(上下对称交换)→	[13, 3, 6, 7],	(对角线交换)→ 	[14, 3, 4, 1],
  [13, 3, 6, 7],					[ 2, 4, 8, 10],					[12, 6, 8, 9],
  [15, 14, 12, 16]					[ 5, 1, 9, 11],					[16, 7,10,11],

注意，对角线交换时，j 的起始条件应该是 j=i，否则会交换两次变回原状。

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