-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path048_RotateImage.cpp
65 lines (60 loc) · 1.72 KB
/
048_RotateImage.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//8.81%
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int len(matrix.size());
if(len < 2)
return;
int startX(0), startY(0);
while(len >= 2){
rotateFourBorders(matrix, startX, startY, len);
len -= 2;
startX++;
startY++;
}
}
private:
inline void rotateFourBorders(vector<vector<int>>& matrix, int startX, int startY, int len){
//1st Round
for(int k = 0; k < len - 1; k++){
swap(matrix[startX][startY + k], matrix[startX + len - k - 1][startY]);
}
//2nd Round
for(int k = 0; k < len - 1; k++){
swap(matrix[startX + len - k - 1][startY], matrix[startX + len - 1][startY + len - 1 - k]);
}
//3rd Round
for(int k = 0; k < len - 1; k++){
swap(matrix[startX + len - 1][startY + len - 1 - k], matrix[startX + k][startY + len - 1]);
}
}
};
//Below are from LeetCode
/*
* clockwise rotate
* first reverse up to down, then swap the symmetry
* 1 2 3 7 8 9 7 4 1
* 4 5 6 => 4 5 6 => 8 5 2
* 7 8 9 1 2 3 9 6 3
*/
void rotate(vector<vector<int> > &matrix) {
reverse(matrix.begin(), matrix.end());
for (int i = 0; i < matrix.size(); ++i) {
for (int j = i + 1; j < matrix[i].size(); ++j)
swap(matrix[i][j], matrix[j][i]);
}
}
/*
* anticlockwise rotate
* first reverse left to right, then swap the symmetry
* 1 2 3 3 2 1 3 6 9
* 4 5 6 => 6 5 4 => 2 5 8
* 7 8 9 9 8 7 1 4 7
*/
void anti_rotate(vector<vector<int> > &matrix) {
for (auto vi : matrix) reverse(vi.begin(), vi.end());
for (int i = 0; i < matrix.size(); ++i) {
for (int j = i + 1; j < matrix[i].size(); ++j)
swap(matrix[i][j], matrix[j][i]);
}
}