119. Pascal's Triangle II
程序员文章站
2022-04-01 12:12:48
...
vector<int> getRow(int rowIndex) {
vector<int> res;
if(rowIndex<0) return res;
res.assign(rowIndex+1,0);
for(int i=0;i<=rowIndex;i++){
if(i==0)
{
res[i]=1;
continue;
}
for(int j=rowIndex;j>0;j--){
res[j]+=res[j-1];
}
}
return res;
}
推荐阅读
-
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
-
[LeetCode]119. Pascal's Triangle II