#
# @lc app=leetcode id=118 lang=python3
#
# [118] Pascal's Triangle
#

# @lc code=start
class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        pascal = [[1] * (i + 1) for i in range(numRows)]
        print(pascal)
        for i in range(numRows):
            for j in range(1, i):
                pascal[i][j] = pascal[i - 1][j -1] + pascal[i -1][j]
        return pascal
# @lc code=end
