【Leetcode】Pascal's Triangle II
来源:互联网 发布:michael angelo 知乎 编辑:程序博客网 时间:2024/06/03 15:16
题目链接:https://leetcode.com/problems/pascals-triangle-ii/
题目:
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?
思路:
要求空间复杂度为O(k),其实只需要记录前一行的结果就可以了。
算法:
1 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
- 【Leetcode】3Sum Closest
- java 之BigInteger类实现计算大整数的阶乘
- (java)Base64 图片编码&&解码
- 【Leetcode】Longest Consecutive Sequence
- 如何筛选连续跌几天的股票?
- 【Leetcode】Pascal's Triangle II
- 简易数码时钟
- 难得的小日记
- Ubuntu下Apache配置SSL笔记
- java 之求交集并集
- 绘图基础
- 创建数据库和表的SQL语句
- Unity 小游戏练习(一)
- mysql单表查询Where 条件查询