【LeetCode】118 - Pascal's Triangle

 1 class Solution {
 2 public:
 3     vector<vector<int>> generate(int numRows) {
 4         vector<vector<int>> vec;
 5         if(numRows==0)return vec;
 6         vector<int> v(1,1);
 7         vec.push_back(v);
 8         
 9         int n=1;
10         while(n<numRows){
11             v.clear();
12             v.push_back(1);
13             for(int i=1;i<vec[n-1].size();i++){
14                 v.push_back(vec[n-1][i-1]+vec[n-1][i]);
15             }
16             v.push_back(1);
17             vec.push_back(v);
18             n++;
19         }
20         return vec;
21     }
22 };