class Solution(object):
def getRow(self, rowIndex):
"""
:type rowIndex: int
:rtype: List[int]
"""
n = rowIndex+1
arr = []
for i in range(n):
arr.append([])
for j in range(i+1):
arr[i].append(1)
for i in range(2, n):
for j in range(1, i):
arr[i][j] = arr[i-1][j-1]+arr[i-1][j]
return (arr[n-1])
119. 杨辉三角 II(LeetCode-力扣-Python)
最新推荐文章于 2024-06-19 16:14:51 发布