leetcode

0 class Solution {

1 public:

2 vector<vector<int>> generate(int numRows) {

3 vector<vector<int>> res;

4

5 for (int i = 0; i < numRows; i++) {

6 vector<int> row;

7 row.push_back(1);

8 for (int j = 1; j < i; j++)

9 row.push_back(res[i - 1][j - 1] + res[i - 1][j]);

10 if (i != 0) row.push_back(1);

11 res.push_back(row);

12 }

13 return res;

14 }

15 };