[LeetCode-Algorithms-48] "Rotate Image" (2017.11.16-WEEK11)

题目链接：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]
]

---

(1)思路：首先要注意不能申请新的矩阵来存储，那么就要找到旋转后与之前的位置关系。经过比较可以发现A[i][j] -> A[j][n-1-i]。

(2)代码：

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

(3)提交结果：