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] ]题意:给定一个数值,返回该数量下的杨辉三角。
思路:逐行生成各行,每行的中间的值是上一行的对应的两个数组元素的和。
class Solution {
public:
vector<vector<int> > generate(int numRows) {
vector<vector<int>> triangle;
if (numRows == 1){
vector<int> m(1, 1);
triangle.push_back(m);
}
if (numRows >= 2){
vector<int> m1(1, 1);
vector<int> m2(2, 1);
triangle.push_back(m1);
triangle.push_back(m2);
for (int i = 2; i < numRows; i++){
vector<int> n(i+1, 1);
for (int j = 1; j < i; j++){
n[j] = triangle[i - 1][j - 1] + triangle[i - 1][j];
}
triangle.push_back(n);
}
}
return triangle;
}
};