class Solution {
public:
vector<vector<int>> generate(int numRows) {
int nums=numRows;
vector<vector<int>>res;
if (nums <= 0)
return res;
res.assign(nums, vector<int>(1,1));//创建了[[1],[1],[1],...]其中[1]的数量为numfor (int i =1; i < nums; ++i)
{
for (int j = 1; j < i; ++j)
{
res[i].push_back(res[i - 1][j - 1] + res[i - 1][j]);
}
res[i].push_back(1);//每行最末位添加加1
}return res;
}
};
方法二
class Solution {
public:
vector<vector<int>> generate(int numRows) {
int nums=numRows;
vector<vector<int>>res;
if (nums <= 0)
return res;
res.assign(nums, vector<int>(1));创建了[[0],[0],[0],...]其中[0]的数量为nums
for (int i =0; i < nums; ++i)
{
res[i][0]=1;
if(i==0)
continue;//本次循环结束,后面的代码不执行,跳回for(int i=0;i<nums;++i)开始
for (int j = 1; j < i; ++j)
{
res[i].push_back(res[i - 1][j - 1] + res[i - 1][j]);
}
res[i].push_back(1);
}return res;
}
};