首先自己百度了一下杨辉三角,结果百度百科里面居然又python的算法,就复制了一分顺便理解了一下,不过照抄算法会有点小问题,测试结果不通过,稍加改动
#!/usr/bin/env python3 # -*- coding: utf-8 -*- #杨辉三角 def triangles(): ret = [1] while True: pre = ret[:] yield pre #遇到yield语句返回对应值,再次执行时从上次返回的yield语句处继续执行 for i in range(1, len(ret)):#range(1,1)得到的列表是空 ret[i] = pre[i] + pre[i - 1] ret.append(1) pre = ret[:] #print(pre) n = 0 results = [] for t in triangles(): results.append(t)#append 因为添加的是地址的指向,所以原数据原地址空间数据改变列表也会改变, n = n + 1 if n == 10: break for t in results: print(t) if results == [ [1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1], [1, 5, 10, 10, 5, 1], [1, 6, 15, 20, 15, 6, 1], [1, 7, 21, 35, 35, 21, 7, 1], [1, 8, 28, 56, 70, 56, 28, 8, 1], [1, 9, 36, 84, 126, 126, 84, 36, 9, 1] ]: print('测试通过!') else: print('测试失败!')
Sign in to make a reply
祥子920
首先自己百度了一下杨辉三角,结果百度百科里面居然又python的算法,就复制了一分顺便理解了一下,不过照抄算法会有点小问题,测试结果不通过,稍加改动