关闭

leetcode 59:Spiral Matrix II

154人阅读 评论(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;
	}
};


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:48242次
    • 积分:2555
    • 等级:
    • 排名:第14987名
    • 原创:215篇
    • 转载:20篇
    • 译文:0篇
    • 评论:2条
    文章分类
    最新评论