【LeetCode】118. Pascal's Triangle

版权声明：本文为博主原创文章，请尊重原创，转载请注明原文地址和作者信息！ https://blog.csdn.net/zzc15806/article/details/81293661

class Solution:
    def generate(self, numRows):
        """
        :type numRows: int
        :rtype: List[List[int]]
        """
        if numRows==0:
            return []
        temp=[0,1]
        pt=[]
        for i in range(numRows):
            rowlist=[]
            for j in range(len(temp)-1):
                rowlist.append(temp[j]+temp[j+1])
            pt.append(rowlist)
            temp=rowlist[:]
            temp.insert(0,0)
            temp.append(0)
        return pt