61 杨辉三角形

# 杨辉三角形

def generate_pascals_triangle(n):
    """生成杨辉三角形术组

    Args:
        n (int): 大于等于1的正整数
    """
    arr = []
    if n == 1:
        arr = [[1]]
    else:
        arr = [[1],[1,1]]
        for m in range(2,n):
            arr_child = []
            arr_child.append(1)
            for i in range(1, m):
                arr_child.append(arr[m-1][i-1]+arr[m-1][i])
            arr_child.append(1)
            arr.append(arr_child)
    return arr


def print_pascals_triangle(n):
    """打印杨辉三角形

    Args:
        n (int): 大于等于1的正整数
    """
    arr = generate_pascals_triangle(n)
    for i in range(len(arr)):
        # 输出空格
        for k in range(len(arr)-len(arr[i])):
            print("\t", end="")
        for j in range(len(arr[i])):
            print(arr[i][j], end="\t"*2)
        print()


print_pascals_triangle(7)