Python基础练习 | 递归杨辉三角

"""
杨辉三角
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1

"""
def yanghuisanjiao(i,j):
    """
    :param i：行
    :param j: 列
    :return:
    """
    if i==j or j==1:
        return 1
    return yanghuisanjiao(i-1,j)+yanghuisanjiao(i-1,j-1)
a=yanghuisanjiao(5,2)
print(a)

　　

转载于:https://www.cnblogs.com/404NooFound/p/10161189.html