LeedCode 118. 杨辉三角 动态规划入门

from typing import List

class Solution:
    def generate(self, n: int) -> List[List[int]]:
        ## 1、构造杨辉三角列表
        dp = [[1 for _ in range(num)] for num in range(1, n + 1)]
        ## 2、遍历杨辉三角列表
        for i in range(n):
            cols = i + 1
            for j in range(cols):
                ## print(i, j, end="\t")
                if i < 2 or j == 0 or j == cols-1:
                    dp[i][j] = 1    ## 3、边界问题解决
                else:               ## 4、核心逻辑实现
                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]
        return dp

slt = Solution()
dp = slt.generate(5)
print(dp)