0%

118. Pascal's Triangle

118. Pascal's Triangle

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
class Solution {
public:
vector<vector<int>> generate(int numRows) {
if(numRows == 0)
return {};
vector<vector<int>> ret(numRows);
ret[0] = {1};
for(int i = 1; i < numRows; ++i)
{
ret[i].push_back(1);
for(int j = 1; j < i; ++j)
ret[i].push_back(ret[i - 1][j - 1] + ret[i - 1][j]);
ret[i].push_back(1);
}
return ret;
}
};