题目:
You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
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.
这道题我觉得很好,所以单独记录一下它的做法。
基本就是两个循环,交换数的位置,达到对图像的旋转。
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
const int n = matrix.size();
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
swap(matrix[i][j], matrix[j][i]);
}
}
for (int i = 0; i < n; ++i) {
reverse(begin(matrix[i]), end(matrix[i]));
}
}
};
参考:
https://zxi.mytechroad.com/blog/algorithms/array/leetcode-48-rotate-image/