[LeetCode] Spiral Matrix II

最新推荐文章于 2021-09-16 20:55:15 发布

hale1007

最新推荐文章于 2021-09-16 20:55:15 发布

阅读量369

点赞数

分类专栏： Algorithm LeetCode

本文链接：https://blog.csdn.net/hale1007/article/details/24919135

版权

Algorithm 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

LeetCode

76 篇文章 0 订阅

订阅专栏

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 ]
]

class Solution {
public:
    vector<vector<int> > generateMatrix(int n) {
        vector<vector<int>> result;
        if(n == 0)  return result;
        result.resize(n);
        for(int i = 0; i < n; i++)
            result[i].resize(n);
        int col_beg = 0, col_end = n-1;
        int row_beg = 0, row_end = n-1;
        int data = 1;
        while(1)
        {
            for(int col = col_beg; col <= col_end; ++col)
                result[row_beg][col] = data++;
            ++row_beg;
            if(data > n*n)  break;
            for(int row  = row_beg; row <= row_end; ++row)
                result[row][col_end] = data++;
            --col_end;
            if(data > n*n)  break;
            for(int col = col_end; col >= col_beg; --col)
                result[row_end][col] = data++;
            --row_end;
            if(data > n*n)  break;
            for(int row = row_end; row >= row_beg; --row)
                result[row][col_beg] = data++;
            ++col_beg;
            if(data > n*n)  break;
        }
        return result;
    }
};