Python基础题目——杨辉三角

输出前10行的杨辉三角。

def yanghui(n):
    triangle = [[1]]  # 初始化第一行
    for i in range(1, n):
        row = [1]  # 每行开头是1
        for j in range(1, i):
            row.append(triangle[i-1][j-1] + triangle[i-1][j])
        row.append(1)  # 每行结尾是1
        triangle.append(row)
    return triangle

# 输出前10行
for row in yanghui(10):
    print(row)

#输出样式
[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
[1, 6, 15, 20, 15, 6, 1]
[1, 7, 21, 35, 35, 21, 7, 1]
[1, 8, 28, 56, 70, 56, 28, 8, 1]
[1, 9, 36, 84, 126, 126, 84, 36, 9, 1]