代码改变世界

leetcode - Pascal's Triangle

2013-10-27 09:52  张汉生  阅读(149)  评论(0编辑  收藏  举报

 

 1 class Solution {
 2 public:
 3     vector<vector<int> > generate(int numRows) {
 4         // Note: The Solution object is instantiated only once and is reused by each test case.
 5         vector<vector<int>> rlt;
 6         if (numRows<=0)
 7             return rlt;
 8         vector<int> tmp;
 9         tmp.push_back(1);
10         rlt.push_back(tmp);
11         for (int i=1; i<numRows; i++){
12             vector<int> iv;
13             iv.push_back(1);
14             for (int j=1; j<i; j++){
15                 iv.push_back(rlt[i-1][j-1]+rlt[i-1][j]);
16             }
17             iv.push_back(1);
18             rlt.push_back(iv);
19         }
20         return rlt;
21     }
22 };