Pascal's Triangle II
来源:互联网 发布:uefi启动ubuntu 编辑:程序博客网 时间:2024/05/16 23:48
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: # @return a list of integers def getRow(self, rowIndex): result = [] for i in range(rowIndex+1): result.append(self.func(rowIndex) / (self.func(i) * self.func(rowIndex-i))) return result def func(self, k): sum = 1 for i in range(1, k+1): sum = sum * i return sum
0 0
- Pascal's Triangle、Pascal's Triangle II
- Pascal's Triangle , Pascal's Triangle II
- Pascal's Triangle & Pascal's Triangle II
- Pascal's Triangle && Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- Pascal's Triangle II
- 作业
- LeetCode 023 Merge k Sorted Lists
- ubuntu下安装node.js、pomelo
- Android动画效果translate、scale、alpha、rotate详解
- java 调用linux实例代码
- Pascal's Triangle II
- Linux那些事儿之我是Sysfs--引子
- 作业
- 笔记CSS3 border
- android Ormlite数据库更新
- hdu 1030 Delta-wave
- Java 加解密技术系列之 3DES
- 2015-03-19 SQL Server 批量插入数据的两种方法
- linux centos下安装dokuwiki