Given numRows, generate the first numRows of Pascal‘s triangle.
For example, given numRows = 5,
Return
[
[1],
[1,1],
[1,2,1],
[1,3,3,1],
[1,4,6,4,1]
]
给定整数numRows, 要求生成杨辉三角的前numRows行
class Solution {
public:
vector<vector<int> > generate(int numRows) {
vector<vector<int> >result;
if(numRows<=0)return result;
for(int row=1; row<=numRows; row++){
vector<int> vals(row, 1);
for(int i=1; i<row-1; i++){
vals[i]=result[row-2][i-1] + result[row-2][i];
}
result.push_back(vals);
}
return result;
}
};LeetCode: Pascal's Triangle [118],布布扣,bubuko.com
LeetCode: Pascal's Triangle [118]
原文地址：http://blog.csdn.net/harryhuang1990/article/details/28849855
