leetcode-python-杨辉三角

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        if numRows == 1:
            return [[1]]
        if numRows == 2:
            return [[1],[1,1]]
        result = [[1],[1,1]]
        cur =  [1,1]
        while numRows > 2:
            next_line = [1]
            for i in range(len(cur)-1):
                t = cur[i]+cur[i+1]
                next_line.append(t)
            next_line.append(1)
            cur = next_line
            # print(cur)
            numRows -= 1
            result.append(cur)
        return result