//这种也是空间复杂度为O(K)的解法,就是边界有点难写
class Solution {
public:
vector<int> getRow(int rowIndex) {
vector<int> res;
res.push_back();
if(rowIndex == ) return res;
res.push_back();
if(rowIndex == ) return res;
for(int i=;i <= rowIndex;i++){
res.push_back();
int a = res[];
int b = res[];
for(int j=;j < i;j++){
res[j] = a+b;
a = b;
b = res[j+];
}
res[i] = ;
}
return res;
}
};
相关文章
- [LeetCode] Closest Leaf in a Binary Tree 二叉树中最近的叶结点
- 【leetcode】623. Add One Row to Tree
- Java实现 LeetCode 623 在二叉树中增加一行(遍历树)
- LeetCode——623.在二叉树中增加一行
- Leetcode 623.在二叉树中增加一行
- [LeetCode] 283. Move Zeroes 移动零
- LeetCode 283. Move Zeroes (移动零)
- LN : leetcode 283 Move Zeroes
- Java [Leetcode 283]Move Zeroes
- leetcode 283. Move Zeroes -easy