杨辉三角的python代码可以这样写:
def triangle(n): lst = [1] for i in range(n): lst.append(0) lst = [lst[j - 1] + lst[j] for j in range(i + 1)] return lst
print(triangle(5))
杨辉三角的python代码可以这样写:
def triangle(n): lst = [1] for i in range(n): lst.append(0) lst = [lst[j - 1] + lst[j] for j in range(i + 1)] return lst
print(triangle(5))