几何翻转
- 思路:
- 顺时针旋转可以拆解成:
- 先沿着水平中轴线进行翻转: m[i][j] -> m[n - 1 - i][j]
- (x1 + x2) / 2 = (n - 1) / 2
- x1 = (n - 1) - x2
- y 轴不变
- 沿着主对角线进行翻转: m[i][j] -> m[j][i]
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int size = matrix.size();
// flip horizontal
for (int i = 0; i < size / 2; ++i) {
for (int j = 0; j < size; ++ j) {
std::swap(matrix[i][j], matrix[size -1 - i][j]);
}
}
// flip main diagonal
for (int i = 0; i < size; ++i) {
for (int j = 0; j < i; ++j) {
std::swap(matrix[i][j], matrix[j][i]);
}
}
}
};