Kiritow
/
OJ-Problems-Source
mirror of https://github.com/Kiritow/OJ-Problems-Source
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Create 48.cpp

master
Kirigaya Kazuto 2018-06-24 12:42:41 +08:00 committed by GitHub
parent 68c35fb868
commit 4c793f2b8f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 96 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

96
LeetCode-CN/48.cpp Normal file
View File

@ -0,0 +1,96 @@
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int n = matrix.size();
if (n % 2) // odd number, easy
{
int mid = n / 2;
for (int dis = 1; dis <= mid; dis++)
{
// do chain swap at distance:dis
int swap_n = 2 * dis + 1;
// save right col
vector<int> tvec;
int begin_pos = mid - dis;
for (int i = 0; i < swap_n; i++)
{
tvec.push_back(matrix[begin_pos + i][mid + dis]);
}
// start rotate
// RIGHT <- UPPER
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", begin_pos + i, mid + dis, mid - dis, begin_pos + i);
matrix[begin_pos + i][mid + dis] = matrix[mid - dis][begin_pos + i];
}
// UPPER <- LEFT
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", mid - dis, begin_pos + i, begin_pos + i, mid - dis);
matrix[mid - dis][begin_pos + (swap_n - i - 1)] = matrix[begin_pos + i][mid - dis];
}
// LEFT <- DOWNER
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", begin_pos + i, mid - dis, mid + dis, begin_pos + i);
matrix[begin_pos + i][mid - dis] = matrix[mid + dis][begin_pos + i];
}
// DOWNER <- TEMP
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-tvec[%d]\n", mid + dis, begin_pos + i, i);
matrix[mid + dis][begin_pos + (swap_n - i - 1)] = tvec[i];
}
// debug
//print(matrix);
}
}
else // oh, this stuff sucks.
{
int mid = n / 2 ;
for (int dis = 1; dis <= mid ; dis++)
{
// do chain swap at distance:dis
int swap_n = 2 * dis;
// save right col
vector<int> tvec;
int begin_pos = mid - dis;
for (int i = 0; i < swap_n; i++)
{
tvec.push_back(matrix[begin_pos + i][mid + dis - 1]);
}
// start rotate
// RIGHT <- UPPER
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", begin_pos + i, mid + dis, mid - dis, begin_pos + i);
matrix[begin_pos + i][mid + dis - 1] = matrix[mid - dis][begin_pos + i];
}
// UPPER <- LEFT
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", mid - dis, begin_pos + i, begin_pos + i, mid - dis);
matrix[mid - dis][begin_pos + (swap_n - i - 1)] = matrix[begin_pos + i][mid - dis];
}
// LEFT <- DOWNER
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-matrix[%d][%d]\n", begin_pos + i, mid - dis, mid + dis, begin_pos + i);
matrix[begin_pos + i][mid - dis] = matrix[mid + dis -1][begin_pos + i];
}
// DOWNER <- TEMP
for (int i = 0; i < swap_n; i++)
{
//printf("matrix[%d][%d]<-tvec[%d]\n", mid + dis, begin_pos + i, i);
matrix[mid + dis -1][begin_pos + (swap_n - i - 1)] = tvec[i];
}
// debug
//print(matrix);
}
}
}
};