【python实现】 119. 杨辉三角 II

解答：python class Solution: def getRow(self, rowIndex: int) -> List[int]: l1 = [1] l2 = [] n = 33 while n >= 0: l2.append(l1) l1 = [sum(t) for

>>阅读原文<<