leetcode 59:Spiral Matrix II

最新推荐文章于 2020-03-17 14:51:42 发布

onlyou2030

最新推荐文章于 2020-03-17 14:51:42 发布

阅读量296

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/onlyou2030/article/details/49913149

版权

leetcode 专栏收录该内容

58 篇文章 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 ]
]

思路：

这题和Spiral Matrix比较相似，具体思路见Spiral Matrix。

时间复杂度：O(n^2)

实现如下：

class Solution {
public:
	vector<vector<int>> generateMatrix(int n) {
		vector<vector<int>> result(n, vector<int>(n, 0));
		int left = 0, right = n - 1, up = 0, down = n - 1, count = 1;
		while (left <= right)
		{
			int column = left;
			for (; column <= right; ++column) result[up][column] = count++;
			++up;
			int row = up;
			for (; row <= down; ++row) result[row][right] = count++;
			--right;
			if (up <= down)
			{
				for (column = right; column >= left; --column) result[down][column] = count++;
				--down;
			}
			if (left <= right)
			{
				for (row = down; row >= up; --row) result[row][left] = count++;
				++left;
			}
		}
		return result;
	}
};