Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.
Note that the row index starts from 0.
In Pascal's triangle, each number is the sum of the two numbers directly above it.
Example:
Input: 3 Output: [1,3,3,1]
昨天还说到这有个公式,今天就用到了
from scipy.special import comb
class Solution(object):
def getRow(self, rowIndex):
"""
:type rowIndex: int
:rtype: List[int]
"""
a=[]
for i in range(rowIndex+1):
a.append(int(round(comb(rowIndex,i))))
return a