杨辉三角应该怎么做啊

如题，想问一下大家怎么用python实现杨辉三角啊，我目前只会输出这一个，接下来该怎么分析啊

参考：https://blog.csdn.net/weixin_42124234/article/details/91046042

程序如下：

def triangle(n):
   print([1])
   line = [1,1]
   print(line)
   for i in range(2,n):
       l=[]
       for j in range(0,len(line)-1):
           l.append(line[j]+line[j+1]) #除去首尾中间的数字
       line = [1]+l+[1] #加上首尾完整的一行
       print(line)

triangle(10)

运行结果：

[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]