forked from luliyucoordinate/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
0059.cpp
39 lines (34 loc) · 979 Bytes
/
0059.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
#include <iostream>
#include <vector>
using namespace std;
static int x = [](){std::ios::sync_with_stdio(false);cin.tie(0);return 0;}();
class Solution
{
public:
vector<vector<int>> generateMatrix(int n)
{
int start = 0, end = n-1;
vector<vector<int>> result(n, vector<int>(n, 0));
int fill = 1;
while (start <= end)
{
for(int i = start; i <= end; i++)
result[start][i] = fill++;
for(int i = start+1; i <= end-1; i++)
result[i][end] = fill++;
if(start != end)
for(int i = end; i >= start; i--)
result[end][i] = fill++;
if(start != end)
for(int i = end-1; i >= start+1; i--)
result[i][start] = fill++;
start++; end--;
}
return result;
}
};
int main()
{
int n = 3;
auto result = Solution().generateMatrix(n);
}