-
Notifications
You must be signed in to change notification settings - Fork 0
/
118.cpp
75 lines (68 loc) · 1.57 KB
/
118.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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <iostream>
#include <vector>
#define MAX 10000;
using namespace std;
class Solution
{
public:
vector<vector<int> > generate(int numRows)
{
vector<vector<int> > result;
vector<int> temp1;
vector<int> temp2;
if(numRows>=1)
{
temp1.push_back(1);
result.push_back(temp1);
}
if(numRows>=2)
{
temp2.push_back(1);
temp2.push_back(1);
result.push_back(temp2);
}
for(int i=3;i<=numRows;i++)
{
if(i%2==0)
{
temp2.clear();
for(int j=0;j<i;j++)
{
if(j==0||j==i-1)
temp2.push_back(1);
else
temp2.push_back(temp1[j-1]+temp1[j]);
}
result.push_back(temp2);
}
else
{
temp1.clear();
for(int j=0;j<i;j++)
{
if(j==0||j==i-1)
temp1.push_back(1);
else
temp1.push_back(temp2[j-1]+temp2[j]);
}
result.push_back(temp1);
}
}
return result;
}
};
int main()
{
Solution s;
vector<vector<int> > rec;
rec=s.generate(5);
cout<<'['<<endl;
for(int i=0; i<rec.size(); i++)
{
for(int j=0; j<rec[i].size(); j++)
cout<<rec[i][j]<<" ";
cout<<endl;
}
cout<<']'<<endl;
return 0;
}