118. Pascal's Triangle

 1 static int wing=[]()
 2 {
 3     std::ios::sync_with_stdio(false);
 4     cin.tie(NULL);
 5     return 0;
 6 }();
 7 
 8 class Solution 
 9 {
10 public:
11     vector<vector<int>> generate(int numRows) 
12     {
13         vector<vector<int>> res;
14         for(int i=1;i<=numRows;i++)
15         {
16             vector<int> cur;
17             cur.push_back(1);
18             for(int j=1;j<i-1;j++)
19             {
20                 int num=res[i-2][j-1]+res[i-2][j];
21                 cur.push_back(num);
22             }
23             if(i>1)
24                 cur.push_back(1);
25             res.push_back(cur);
26         }
27         vector<vector<int>> &k=res;
28         return k;
29     }
30 };