118. Pascal's Triangle
程序员文章站
2022-04-01 11:33:41
...
vector<vector<int>> generate(int numRows) {
vector<vector<int>> res;
if(numRows<=0) return res;
res.assign(numRows,vector<int>(1,1));
for(int i=1;i<numRows;i++){
for(int j=1;j<res[i-1].size();j++)
res[i].push_back(res[i-1][j]+res[i-1][j-1]);
res[i].push_back(1);
}
return res;
}
推荐阅读
-
POJ 2704 Pascal's Travels G++ dfs记忆化搜索
-
Leetcode No.119 Pascal's Triangle II(c++实现)
-
杨辉三角(pascal's triangle)
-
LeetCode-119. Pascal's Triangle II
-
119. Pascal's Triangle II [杨辉三角形2]
-
119. Pascal's Triangle II
-
leetcode -- 119. Pascal's Triangle II
-
2018.05.03 leetcode #119. Pascal's Triangle II
-
【leetcode】119. Pascal's Triangle II
-
LeetCode 119. Pascal's Triangle II