1-2-顺时针打印矩阵

/*
    题目描述：
    对于一个矩阵，请设计一个算法从左上角(mat[0][0])开始，顺时针打印矩阵元素。
    给定int矩阵mat,以及它的维数nxm，请返回一个数组，数组中的元素为矩阵元素的顺时针输出。
    测试样例：
        [[1,2],[3,4]],2,2
        返回：[1,2,3,4]
*/
/*
    还是要注意细节，坐标在变换的时候，应该如何增减。
*/
#include <iostream>
#include <vector>
using namespace std;

vector<int> printEdge(vector<vector<int> > mat, int t1, int t2, int d1, int d2){
    vector<int> frm;
    if (t1 == d1){//子矩阵只有一行
        for (int i = t2; i <= d2; i++)
            frm.push_back(mat[t1][i]);
    }
    else if (t2 == d2){//子矩阵只有一列
        for (int i = t1; i <= d1; i++)
            frm.push_back(mat[i][t2]);
    }
    else{//一般情况
        int svt1 = t1;
        int svt2 = t2;
        while(t2 < d2){
            frm.push_back(mat[t1][t2]);
            t2++;
        }
        while (t1 <= d1){
            frm.push_back(mat[t1][d2]);
            t1++;
        }
        while (t2 > svt2+1){
            t2--;
            frm.push_back(mat[d1][t2]);
        }
        t2--;
        while (t1-1 > svt1){
            t1--;
            frm.push_back(mat[t1][t2]);
        }
    }
    return frm;
}
vector<int> clockwisePrint(vector<vector<int> > mat, int n, int m){
    int t1 = 0;
    int t2 = 0;
    int d1 = n-1;
    int d2 = m-1;
    vector<int> rt;
    while (t1 <= d1 && t2 <= d2){
        vector<int> edge = printEdge(mat, t1++, t2++, d1--, d2--);
        for (int i = 0; i < edge.size(); i++)
            rt.push_back(edge[i]);
    }
    return rt;
}

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(5);
    b.push_back(6);
    b.push_back(7);
    b.push_back(8);
    matrix.push_back(b);

    vector<int> c;
    c.push_back(9);
    c.push_back(10);
    c.push_back(11);
    c.push_back(12);
    matrix.push_back(c);

    vector<int> d;
    d.push_back(13);
    d.push_back(14);
    d.push_back(15);
    d.push_back(16);
    matrix.push_back(d);
*/
    vector<int> a;
    a.push_back(98);
    a.push_back(30);
    a.push_back(17);
//    a.push_back(4);
    matrix.push_back(a);

    vector<int> b;
    b.push_back(38);
    b.push_back(96);
    b.push_back(90);
//    b.push_back(8);
    matrix.push_back(b);

    vector<int> c;
    c.push_back(17);
    c.push_back(0);
    c.push_back(50);
//    c.push_back(12);
    matrix.push_back(c);

    vector<int> d;
    d.push_back(44);
    d.push_back(12);
    d.push_back(67);
//    d.push_back(16);
    matrix.push_back(d);

    vector<int> e;
    e.push_back(12);
    e.push_back(79);
    e.push_back(43);
//    b.push_back(8);
    matrix.push_back(e);

    vector<int> f;
    f.push_back(43);
    f.push_back(63);
    f.push_back(40);
//    c.push_back(12);
    matrix.push_back(f);

    vector<int> g;
    g.push_back(19);
    g.push_back(93);
    g.push_back(48);
//    d.push_back(16);
    matrix.push_back(g);

    vector<int> rt;
    rt = clockwisePrint(matrix, 7, 3);
    for (int i = 0; i < rt.size(); i++)
        cout << rt[i] << ",";
    cout << endl;
    return 0;
}