Given an index k, return the kth row of the Pascal's triangle.
For example, given k = 3,
Return [1,3,3,1]
.
杨辉三角:
性质:第n行的m个数可表示为 C(n-1,m-1),即为从n-1个不同元素中取m-1个元素的组合数。
code:
class Solution(object):
def getRow(self, rowIndex):
"""
:type rowIndex: int
:rtype: List[int]
"""
res=[1]
for i in range(1,rowIndex+1):
res.append(reduce(lambda x,y:x*y,[x for x in range(rowIndex-i+1,rowIndex+1)])/reduce(lambda x,y:x*y,[x for x in range(1,i+1)]))
return res