[LeetCode]48. Rotate Image

Description:

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

————————————————————————————————————————————————————————————————————————

Solution:

关键是要找到访问的数学规律，并具体为公式。特别要注意访问的顺序和边界判定。

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

以下是一开始理解错题意，将每个元素都顺时针循环一次的代码，算是一种变形练习吧..

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