LeetCode48. Rotate Image（C++）

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/2个圈。题目要求空间复杂度为常数，这样的话，也就是说，我们如果想转一个点，肯定要同时把这个点在旋转的时候涉及的点都找出来，然后不难发现，其实每个点涉及的点也不过就是4个，我们在旋转的时候只要对第一条边上的点（不包括最后一个！）依次进行四个一组的轮换即可。特别特别要弄清楚各下标。

class Solution {
public:
    void rotate(vector<vector<int>>& matrix) {
        int n=matrix.size();
        int len=n/2;
        for(int d=0;d<len;d++){
            int wide=n-d-1;
            for(int i=d;i<wide;i++){
                int temp=matrix[d][i];
                matrix[d][i]=matrix[n-i-1][d];
                matrix[n-i-1][d]=matrix[wide][n-i-1];
                matrix[wide][n-i-1]=matrix[i][wide];
                matrix[i][wide]=temp;
            }
        }
    }
};