Pascal's Triangle

 1  vector<vector<int>> generate(int numRows) {
 2         vector<vector<int>>result;
 3         vector<int>temp;
 4         
 5         if (numRows >= 1)
 6         {
 7             temp.push_back(1);
 8             result.push_back(temp);
 9             temp.clear();
10             
11             for (int i = 1; i < numRows; ++i)
12             {
13                 for (int j = 0; j <= i; ++j)
14                 {
15                     if (j == 0)
16                         temp.push_back(result[i-1][0]);
17                     else if (j==result[i-1].size())
18                         temp.push_back(result[i-1][j-1]);
19                     else
20                         temp.push_back(result[i-1][j]+result[i-1][j-1]);
21                 }
22                 result.push_back(temp);
23                 temp.clear();
24             }
25         }
26         return result;
27     }