LeetCode || Spiral Matrix II

来源:互联网 发布:ubuntu服务器密码修改 编辑:程序博客网 时间:2024/06/09 21:49

Spiral Matrix II

 

题目链接

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 ]]
耗时:4ms。


class Solution {public:    vector<vector<int>> generateMatrix(int n) {        vector<vector<int>> v;        v.resize(n);        for(int i = 0;i<n;i++)        {            v[i].resize(n);        }                int count = 1;        int i = -1, j = -1;        int t = 0;        while(count <= n*n)        {            i++;            j++;            while(i < n - t)            {                v[j][i] = count++;                i++;            }                        i--;            j++;            while(j<n-t)            {                v[j][i] = count++;                j++;            }                        j--;            i--;            while(i>=0+t)            {                v[j][i] = count++;                i--;            }                        i++;            j--;            while(j >= 1+t)            {                v[j][i] = count++;                j--;            }                        t++;        }        return v;            }};


0 0
原创粉丝点击