给定一个非负整数 numRows,生成杨辉三角的前 numRows 行。
在杨辉三角中,每个数是它左上方和右上方的数的和。
示例:
输入: 5 输出: [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]
f(i,j)=f(i−1,j−1)+f(i−1,j)
f(i,j)=1wherej=1 or j=i
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> result;
if (numRows <= 0)
return result;
vector<int> temp;
if (numRows == 1) {
temp.push_back(1);
result.push_back(temp);
return result;
}
temp.push_back(1);
result.push_back(temp);
for (int row = 1; row < numRows; row++) {
temp.clear();
for (int col = 0; col <= row; col++) {
if (col == 0 || col == row) {
temp.push_back(1);
}
else {
temp.push_back(result[row - 1][col - 1] + result[row - 1][col]);
}
}
result.push_back(temp);
}
return result;
}
};