首页 > 代码库 > Leetcode Spiral Matrix II
Leetcode 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) { vector<vector<int> > res(n,vector<int>(n,0)); int dx[] = {0,1,0,-1}; int dy[] = {1,0,-1,0}; int cnt = 1,step = 0,x = 0 , y = 0; while(cnt <= n*n){ step%=4; res[x][y] = cnt++; if(x+dx[step] >=n || x+dx[step] < 0 || y+dy[step] >=n || y+dy[step] < 0 || res[x+dx[step]][y+dy[step]]) step++; x+=dx[step%4];y+=dy[step%4]; } return res; }};
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。