deftriangles():
tria =[1]whileTrue:yield tria
tria =[tria[i]+ tria[i +1]for i inrange(len(tria)-1)]
tria.insert(0,1)
tria.append(1)
n =0
results =[]for t in triangles():
results.append(t)
n = n +1if n ==10:breakfor 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('测试失败!')
2. py实现汉诺塔
defhanoi(n, a, b, c):if n ==1:print(a,'-->', c)else:
hanoi(n -1, a, c, b)
hanoi(1, a, b, c)
hanoi(n -1, b, a, c)
hanoi(3,'A','B','C')
3. py删除字符串空格
deftrim(s):while s[:1]==' ':
s = s[1:]while s[-1:]==' ':
s = s[:-1]return s