leetcode-119-杨辉三角②

题目描述：

第一次提交：

class Solution:
    def getRow(self, rowIndex: int) -> List[int]:
        k = rowIndex
        pre = [1] + [0] * k
        res = [1] + [0] * k
        for i in range(1,k+1):
            for j in range(1,i+1):
                res[j] = pre[j] + pre[j-1]
            pre =res[:]
        return res

另：

class Solution:
    def getRow(self, rowIndex: int) -> List[int]:
        tmp = [] 
        for _ in range(rowIndex + 1): 
            tmp.insert(0, 1) 
            for i in range(1, len(tmp) - 1): 
                tmp[i] = tmp[i] + tmp[i+1] 
        return tmp