螺旋矩阵

淡年华零

于 2020-06-06 16:56:47 发布

阅读量136

点赞数

分类专栏：算法文章标签：算法 leetcode

本文链接：https://blog.csdn.net/weixin_44415209/article/details/106590144

版权

算法专栏收录该内容

15 篇文章 1 订阅

订阅专栏

一，代码

#include"iostream"
#include"vector"
using namespace std;
 vector<int> a;
void add(const vector< vector<int> >& m) {
    int row = m.size();
    int col = m[0].size();

    int left =0 ,top = 0, right = col -1 ,bottom = row -1;

     while(left <= right && top <= bottom) {
        //第一行
        for (int i = left ; i <=right ; i++ ) {
            a.push_back(m[top][i]);
        }
        //最右边
        for (int j = top +1 ; j <= bottom ; j++ ) {
            a.push_back(m[j][right]);
        }
    if(left != right && top != bottom) {
            //最下边
         for (int i = right - 1 ; i >= left ; i--) {
            a.push_back(m[right][i]);
         }
         //最左边
         for (int j = bottom - 1 ; j > top ; j--) {
            a.push_back(m[j][left]);
         }
        }
        left ++; top ++ ; right -- ; bottom --;
     }

}
void Print(const vector<int> &maze) {
   for(int m = 0; m < maze.size(); m++)
    {

            cout << maze[m] << " ";

    }
}

int main()
{
    int i = 0, j = 0;

	vector< vector<int> > maze(3, vector<int> (3, 0));
    int A[3][3] = { { 1,2,3 },
                    { 4,5,6 },
                    { 7,8,9 }
                   };
    int m, n;
    for(m = 0; m < maze.size(); m++)
    {
        for(n = 0; n < maze[m].size(); n++)
        {
            maze[m][n] = A[m][n];
            cout << maze[m][n] << " ";
        }
        cout << "\n";
    }
   add(maze);
   Print(a);
   return 0;
}