LeetCode 118杨辉三角

题目描述

easy

解题

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        triangle = []
        for row_num in range(numRows):
            row = [1 for i in range(row_num+1)]
            for j in range(1,row_num):
                row[j] = triangle[row_num-1][j-1]+triangle[row_num-1][j]
            triangle.append(row)
        return triangle

Python注意点

• row = [1 for i in range(row_num+1)]
• triangle.append(row)