LeetCode 118 -Python 3 (Week 05 – 13)

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        if numRows == 0: return []
    
        ans = []
        
        for n in range(numRows):
            tmp = []
            for i in range(n+1):
                if i == 0 or i == n: tmp.append(1)
                else:
                    tmp.append(ans[n-1][i-1]+ans[n-1][i])
            ans.append(tmp)
            
        return ans