Leetcode #59 Spiral Matrix II

最新推荐文章于 2022-03-23 11:05:06 发布

每天都要有进步

最新推荐文章于 2022-03-23 11:05:06 发布

阅读量245

点赞数

分类专栏： Leetcode 暑假备战UVa

本文链接：https://blog.csdn.net/u011472124/article/details/47061805

版权

Leetcode 同时被 2 个专栏收录

262 篇文章 0 订阅

订阅专栏

暑假备战UVa

103 篇文章 0 订阅

订阅专栏

Difficulty: Medium

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

For example,
Given n = 3,

You should return the following matrix:

[
 [ 1, 2, 3 ],
 [ 8, 9, 4 ],
 [ 7, 6, 5 ]
]

vector<vector<int> > generateMatrix(int n) {
        vector<vector<int> > matrix;
        vector<int> temp;
        if(n==0)
            return matrix;
        for(int i = 0;i<n;i++)
            temp.push_back(0);
        for(int i = 0;i<n;i++)
            matrix.push_back(temp);
        int left = 0, up = 0, cou = 1;
        int right = n-1, down = n-1;
        //cout<<left<<right<<up<<down<<endl;
        while(right>left&&down>up)
        {
            for(int i = left;i<=right;i++){
                matrix[up][i] = cou;
                cou++;
            }

            for(int i = up+1; i<down;i++){
                matrix[i][right] = cou;
                cou++;
            }
            
            for(int i = right;i>=left;i--){
                matrix[down][i] = cou;
                cou++;
            }
          
            for(int i = down-1; i>up;i--){
                matrix[i][left] = cou;
                cou++;
            }
           
            left++;right--;
            up++;down--;
         
        }
        if(left==right&&up==down)
            matrix[up][up] = cou;
        return matrix;
    }