接上题的旋转打印矩阵,本题是将矩阵旋转90度打印
1. 题目描述
将一个矩阵顺时针旋转90度, 比如给定一个矩阵A:
旋转之后为:
2. 思路
和打印矩阵一样,这里也是从宏观出发,先旋转最外圈的,然后在旋转内圈的正方形. 关于我们旋转一个正方形代码我们只需要找到规律就好了.这里我们直接上代码了.
3. 代码
#include <iostream>
#include <vector>
template<typename T>
void rotateEdage(std::vector<std::vector<T>>& my_matrix, int tR, int tC, int dR, int dC) {
int times = dR - tR;
T tmp = 0;
for (int i = 0; i != times; ++i) {
tmp = my_matrix[tR][tC + i];
my_matrix[tR][tC + i] = my_matrix[dR - i][tC];
my_matrix[dR - i][tC] = my_matrix[dR][dC - i];
my_matrix[dR][dC - i] = my_matrix[tR + i][dC];
my_matrix[tR + i][dC] = tmp;
}
}
template<typename T>
void rotateMatrix(std::vector<std::vector<T>>& my_matrix) {
int tR = 0;
int tC = 0;
int dR = my_matrix.size() - 1;
int dC = my_matrix[0].size() - 1;
while (tR < dR) {
rotateEdage(my_matrix, tR++, tC++, dR--, dC--);
}
}
template<typename T>
void printMatrix(std::vector<std::vector<T>>& my_matrix) {
for (int i = 0; i < my_matrix.size(); ++i) {
for (int j = 0; j < my_matrix[0].size(); ++j) {
std::cout << my_matrix[i][j] << ",";
}
std::cout << "\n";
}
}
int main()
{
std::vector<std::vector<int>> my_matrix = {{1, 2, 3, 4},
{5, 6, 7, 8},
{9, 10, 11, 12},
{13,14, 15, 16}};
std::cout << "origin matrix:" << std::endl;
printMatrix(my_matrix);
rotateMatrix(my_matrix);
std::cout << "rotate matrix:" << std::endl;
printMatrix(my_matrix);
return 0;
}