-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathSpiral Matrix II.cpp
47 lines (33 loc) · 1.07 KB
/
Spiral Matrix II.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
Solution by Rahul Surana
***********************************************************
Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.
***********************************************************
*/
#include <bits/stdc++.h>
class Solution {
public:
vector<vector<int>> generateMatrix(int n) {
int r1 = 0, r2 = n-1;
int c1 = 0, c2 = n-1;
int val = 0;
vector<vector<int>> v(n, vector<int> (n));
while(r1 <= r2 && c1 <= c2)
{
for(int i = c1; i <= c2; ++i) v[r1][i] = ++val;
for(int i = r1+1; i <= r2; ++i) v[i][c2] = ++val;
if(r1 < r2 && c1 < c2)
{
for(int i = c2-1; i>c1; --i)
v[r2][i] = ++val;
for(int i = r2; i > r1; --i)
v[i][c1] = ++val;
}
++r1;
--r2;
++c1;
--c2;
}
return v;
}
};