59. Spiral Matrix II

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 == 0)
		{
			vector<vector<int>> ans;
			return ans;
		}
		vector<vector <int> > matrix(n, vector<int>(n, 0));
		int total = n*n;
		int num = 0;
		int left, right, top, buttom;
		left = 0;
		top = 0; //第 0 行
		buttom = n;
		right = n;

		while (total > num)
		{
			for (int i = left; i < right; ++i)
			{
				num++;
				matrix[top][i] = num;
				if (total == num) return matrix;
			}
			top++;
			for (int j = top; j < buttom; j++)
			{
				num++;
				matrix[j][right - 1] = num;
				if (num == total) return matrix;
			}
			right--;
			for (int i = right - 1; i >= left; i--)
			{
				num++;
				matrix[buttom - 1][i] = num;
				if (num == total) return matrix;
			}
			buttom--;
			for (int j = buttom - 1; j >= top; j--)
			{
				num++;
				matrix[j][left] = num;
				if (num == total) return matrix;
			}
			left++;
		}
		return matrix;
	}
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值