1-3-顺时针旋转矩阵

/*
    题目描述：
        有一个NxN整数矩阵，请编写一个算法，将矩阵顺时针旋转90度。
        给定一个NxN的矩阵，和矩阵的阶数N,请返回旋转后的NxN矩阵,保证N小于等于300。
        测试样例：
            [[1,2,3],[4,5,6],[7,8,9]],3
            返回：[[7,4,1],[8,5,2],[9,6,3]]
*/
/*
    将矩阵顺时针旋转90度
    一圈一圈的进行旋转(交换)。
    eg:
        1 2 3
        4 5 6
        7 8 9
    先旋转外圈：
        首先交换1->3->9->7->1;
        然后交换2->6->8->4->2;
*/
#include <iostream>
#include <vector>
using namespace std;

void rotateEdge(vector<vector<int> > &m, int tr, int tc, int dr, int dc){
    int times = dc - tc;
    int tmp = 0;
    for (int i = 0; i < times; i++){
        tmp = m[tr][tc+i];
        m[tr][tc+i] = m[dr-i][tc];
        m[dr-i][tc] = m[dr][dc-i];
        m[dr][dc-i] = m[tr+i][dc];
        m[tr+i][dc] = tmp;
    }
}
vector<vector<int> > rotateMatrix(vector<vector<int> > mat, int n) {
    // write code here
    int tR = 0;
    int tC = 0;
    int dR = n-1;
    int dC = n-1;
    while (tR < dR){
        rotateEdge(mat, tR++, tC++, dR--, dC--);
    }
    return mat;
}
int main(){
    vector<vector<int> > matrix;
    vector<int> a;
    a.push_back(1);
    a.push_back(2);
    a.push_back(3);/*
    a.push_back(4);*/
    matrix.push_back(a);

    vector<int> b;
    b.push_back(4);
    b.push_back(5);
    b.push_back(6);/*
    b.push_back(8);*/
    matrix.push_back(b);

    vector<int> c;
    c.push_back(7);
    c.push_back(8);
    c.push_back(9);/*
    c.push_back(12);*/
    matrix.push_back(c);

    vector<vector<int> > rt;
    rt = rotateMatrix(matrix,3);
    for (int i = 0; i < 3; i++){
        for (int j = 0; j < 3; j++)
            cout << rt[i][j] << ",";
        cout << endl;
    }
    return 0;
}