LeetCode Spiral Matrix II

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

kassical

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

阅读量574

点赞数

分类专栏： LeetCode 文章标签： leetcode matrix

本文链接：https://blog.csdn.net/kassical/article/details/39457437

版权

LeetCode 专栏收录该内容

98 篇文章 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> > Array(n, vector<int>(n, 0));

		if (n <= 0)
			return Array;

		setNum(Array, 0, n - 1, 1);

		return Array;
	}

	void setNum(vector<vector<int> > &Array, int left, int right, int index) {
		if (left > right)
			return;

		if (left == right) {
			Array[left][left] = index;
			return;
		}

		for (int j = left; j <= right; ++j) {
			Array[left][j] = index++;
		}
		
		for (int i = left + 1; i <= right; ++i) {
			Array[i][right] = index++; 
		}

		for (int j = right - 1; j >= left; --j) {
			Array[right][j] = index++;
		}

		for (int i = right - 1; i > left; --i) {
			Array[i][left] = index++;
		}

		setNum(Array, left + 1, right - 1, index);
	}
};