【Leetcode】Pascal's Triangle II
来源:互联网 发布:淘宝开饰品店 编辑:程序博客网 时间:2024/06/06 15:02
题目:
Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
Note:
Could you optimize your algorithm to use only O(k) extra space?
代码:
class Solution {public: vector<int> getRow(int rowIndex) { vector<int> result; if(rowIndex<0)return result; result.push_back(1); for(int i=0;i<rowIndex;i++){ for(int j=i;j>0;j--){ result[j]=result[j]+result[j-1]; } result.push_back(1); } return result; }};
0 0
- LeetCode Pascal's Triangle II
- LeetCode: Pascal's Triangle II
- [LeetCode] Pascal's Triangle II
- [Leetcode] Pascal's Triangle II
- 【leetcode】Pascal's Triangle II
- LeetCode - Pascal's Triangle II
- Leetcode: Pascal's Triangle II
- LeetCode-Pascal's Triangle II
- [leetcode] Pascal's Triangle II
- LeetCode - Pascal's Triangle II
- LeetCode | Pascal's Triangle II
- Pascal's Triangle II -leetcode
- Leetcode Pascal's Triangle II
- [LeetCode] Pascal's Triangle II
- Leetcode: Pascal's Triangle II
- Leetcode Pascal's Triangle II
- LeetCode Pascal's Triangle II
- LeetCode Pascal's Triangle II
- 如何使用libsvm进行分类
- 设计模式------------抽象工厂
- 修改织梦默认模板路径
- 设置UITableView刷新某一行的代码
- 做技术的出路在哪?
- 【Leetcode】Pascal's Triangle II
- Ehcache与terracotta集群配置
- vim跳转到指定行
- C/C++变量声明——extern关键字
- SVN
- SVN错误中文对照
- 互联网容灾
- 第四周作业·第三章
- windows自动关机