118. 杨辉三角
class Solution {
public:
vector<vector<int>> generate(int numRows) {
vector<vector<int>> triangle(numRows, vector<int>(numRows, 0));
// base状态初始化
vector<vector<int>> result = {{1}};
for(int i = 0; i < numRows; i++){
triangle[i][0] = 1;
}
// 状态转移
for(int i = 1; i < numRows; i++){
vector<int> temp = {1};
for(int j = 1; j <= i; j++){
triangle[i][j] = triangle[i - 1][j] + triangle[i - 1][j - 1];
temp.emplace_back(triangle[i][j]);
}
result.emplace_back(temp);
}
return result;
}
};