杨辉三角Python

代码:

# 杨辉三角
def trianges(num ):
    ls = [1]
    for x in range(1, num + 1):  # 表示每一行有几个元素 并且同时循环直到哪些
        print(ls)
        lt = []
        ls.insert(0, 0)
        ls.insert(len(ls)+1, 0)
        for y in range(len(ls)-1):
            gg = ls[y] + ls[y+1]
            lt.append(gg)
        ls = lt
    return None
if __name__ == "__main__":
    num = int(input())
    trianges(num)