题目:
给定一个非负索引 k,其中 k ≤ 33,返回杨辉三角的第 k 行。
在杨辉三角中,每个数是它左上方和右上方的数的和。
示例:
输入: 3
输出: [1,3,3,1]
进阶:
你可以优化你的算法到 O(k) 空间复杂度吗?
python代码1:
class Solution:
def getRow(self, rowIndex):
if rowIndex == 0: return [1]
if rowIndex == 1: return [1, 1]
list = [[] for i in range(rowIndex+1)]
list[0] = [1]
list[1] = [1, 1]
for i in range(2, rowIndex+1):
list[i] = [1 for j in range(i + 1)]
for j in range(1, i):
list[i][j] = list[i - 1][j - 1] + list[i - 1][j]
return list[rowIndex]
Python代码2:
class Solution(object):
def getRow(self, rowIndex):
l = []
for i in range(rowIndex+1):
l.append(self.Combination(rowIndex, i))
return l
def fac(self,x):
if x == 0 or x == 1:
return 1
return x * self.fac(x-1)
def Combination(self,n,m):
if m == 0 or m == n:
return 1
return self.fac(n)/(self.fac(n-m)*self.fac(m))
python代码3:
class Solution:
def getRow(self, rowIndex):
if rowIndex < 0: return []
re = [0] * (rowIndex + 1)
for i in range(rowIndex + 1):
re[i] = 1
for j in xrange(i - 1, 0, -1):
re[j] += re[j - 1]
return re