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] ]
输出杨辉三角,注意它的生成方法,每个数都是其两肩数之和。其次要注意vector的花括号初始化方法。
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> result;
for (int i = 0; i < numRows; i++) {
result.push_back({});
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i) {
result[i].push_back(1);
} else {
result[i].push_back(result[i - 1][j - 1] + result[i - 1][j]);
}
}
}
return result;
}
};