leetcode 118. Pascal's Triangle python

class Solution(object):
    def generate(self, numRows):
        """
        :type numRows: int
        :rtype: List[List[int]]
        """
        list = []
        for i in range(0,numRows):
            list.append([1]*(i+1))
            if i > 1:
                for j in range(1,i):
                    list[i][j] = list[i-1][j-1] + list[i-1][j]
        return list

先建立[[1],[1,1],[1,1,1],[1,1,1,1]]，再对数组内部进行替换。