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) {
        for(int i =0; i < matrix.size(); i++){
            for(int j=i+1; j < matrix[0].size(); j++){
                swap(matrix[i][j],matrix[j][i]);
            }
        }
        for(int i=0; i <matrix.size(); i++){
            for(int j=0; j < matrix[0].size()/2; j++){
                swap(matrix[i][j],matrix[i][matrix[0].size()-1-j]);
            }
        }
    }