Leetcode 118. Pascal's Triangle

 题目链接：https://leetcode.com/problems/pascals-triangle

Given numRows, generate the first numRows of Pascal's triangle.

For example, given numRows = 5,
Return

[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]


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