想了好久。。。算一般的方法吧
Topic source
def yanghui_triangle(n):
'''输出杨辉三角形第n行列表数据'''
row = 1
previous_list = [1]
current_list= []
if n >= 1:
yield previous_list
while n > row:
previous_list.insert(0, 0)
previous_list.append(0)
row += 1
slider = 0
while row > slider:
current_list_num = previous_list[slider] + previous_list[slider + 1]
current_list.append(current_list_num)
slider += 1
yield current_list
previous_list = current_list
current_list = []
- 1
Tb要更加努力
def yanghui_triangle(n):
'''输出杨辉三角形第n行的数据列表'''
row = 1
previous_list = [1]
current_list = []
yield previous_list
while n > row:
slider = 0
row += 1
previous_list.insert(0, 0)
previous_list.append(0)
while row > slider:
current_num = previous_list[slider] + previous_list[slider + 1]
current_list.append(current_num)
slider += 1
yield current_list
previous_list = current_list
current_list = []