找规律即可
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>> res;
for(int i=0;i<numRows;i++)
{
vector<int> flag;
flag.push_back(1);
for (int j = 1; j<i; j++)
flag.push_back(res[i - 1][j - 1] + res[i - 1][j]);
if(i!=0)
flag.push_back(1);
res.push_back(flag);
}
return res;
}
};