力扣 118. 杨辉三角 python AC

动态规划

class Solution:
    def generate(self, numRows):
        dp = [[1]]
        if numRows == 1:
            return dp
        dp += [[0] * i for i in range(2, numRows + 1)]
        for i in range(1, numRows):
            for j in range(i + 1):
                if j == 0 or j == i:
                    dp[i][j] = 1
                else:
                    dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]
        return dp