Leetcode 59. Spiral Matrix II (Medium) (cpp)

最新推荐文章于 2016-12-28 08:12:17 发布

Niko_Ke

最新推荐文章于 2016-12-28 08:12:17 发布

阅读量281

点赞数

分类专栏： Leetcode C++ C++ Leetcode Array 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52045675

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Array

96 篇文章 0 订阅

订阅专栏

Leetcode 59. Spiral Matrix II (Medium) (cpp)

Tag: Array

Difficulty: Medium

/*

59. Spiral Matrix II (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 ]
]

*/
class Solution {
public:
	vector<vector<int>> generateMatrix(int n) {
		if (n < 1) {
            return {};
        }
        vector<vector<int>> res(n, vector<int>(n));
        int i = n - 1, j = n - 1, k = 1, h = 0, l = 0;
        while (k <= n * n) {
            for (int col = l; col <= j; col++) {
                res[h][col] = k++;
            }
            if (++h > i) {
                break;
            }
            for (int row = h; row <= i; row++) {
                res[row][j] = k++;
            }
            if (--j < l) {
                break;
            }
            for (int col = j; col >= l; col--) {
                res[i][col] = k++;
            }
            if (--i < h) {
                break;
            }
            for (int row = i; row >= h; row--) {
                res[row][l] = k++;
            }
            if (++l > j) {
                break;
            }
        }
        return res;
    }
};