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

源码：

只需要有外层向内层，每一层分别处理即可。

每一层当中，分成上下左右四部分，每次交换这四部分中对应的值。

class Solution {
public:
    void rotate(vector<vector<int>>& matrix) {
    int length = matrix.size();
    // cout<<length<<endl;
    if(length<=1)   return;
    for(int index=0; index<length/2; index++){
        for(int i=index; i<length-index-1; i++){
            // cout<<"yufan "<<i<<" "<<index<<endl;
            // cout<<matrix[0][0]<<" "<<matrix[0][2]<<endl;
            int tmp = matrix[i][length-index-1];
            matrix[i][length-index-1] = matrix[index][i];
            // cout<<"yufan"<<endl;
            
            int tmp1 = matrix[length-index-1][length-i-1];
            matrix[length-index-1][length-i-1] = tmp;
            // cout<<"yufan1"<<endl;
            
            int tmp2 = matrix[length-i-1][index];
            matrix[length-i-1][index] = tmp1;
            // cout<<"yufan2"<<endl;
            
            matrix[index][i] = tmp2;
        }
    }
}
};