eddietk的博客

from functools import reducedef prod(l): return reduce(lambda x,y:x * y,l)测试代码：print('3 * 5 * 7 * 9 =', prod([3, 5, 7, 9]))if prod([3, 5, 7, 9]) == 945: print('测试成功!')else: print('测试失败!')

在学习Python的过程中，from functools import reducedef fn(x, y): return x * 10 + ydef char2num(s): digits = {'0': 0, '1': 1, '2': 2, '3': 3, '4': 4, '5': 5, '6': 6, '7': 7, '8': 8, '9': 9} return digits[s]reduce(fn, map(char2num, '13579'))...

关于汉诺塔用递归函数，一遍有一遍的看了很多教程，却始终不能理解。看了这篇文章后，明白很多。链接：https://blog.youkuaiyun.com/weixin_42365252/article/details/83787897

def findMinAndMax(L): if len(L)==0: return (None,None) (mins,maxs)=(L[0],L[0]) for nums in L: if maxs<nums: maxs=nums for nums in L: if mins>nums: mins=nums return (mins.