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]
]

解决方法：

图形的旋转，很容易理解的顺序：

- 从外到里，一圈一圈的旋转

- 每次旋转有四个点：左上，右上，左下，右下。由于旋转的规律，其实四个点只有四个坐标值，旋转时注意横竖坐标的变换。同时只需要三次图形数值的交换。

代码：

void rotate(vector<vector<int>>& matrix) {
        int n = matrix.size();
        int a = 0, b = n -1;
        while(a < b){
            for(int i = 0; i < (b-a);i++){
                swap(matrix[a][a+i], matrix[a+i][b]);
                swap(matrix[a][a+i], matrix[b][b-i]);
                swap(matrix[a][a+i], matrix[b-i][a]);
            }
            a++, b--;        
        }
    }