找大小已经解决了：
def findMinAndMax(L): if L==[]: return None,None for i in range(len(L)): if not isinstance(L[i],(int,float)):#判断list类型 raise('TypeError') for i in range(len(L)): min=L[0] max=L[0] if min>=L[i]: min=L[i] if max<=L[i]: max=L[i] return min,max#之前一直显示输出是none，就是忘了写return蠢哭 print('findMinAndMax([7,4,5,4.3,1])=',findMinAndMax([7,4,5,4.3,1]))虽然看上去无比稚嫩，而且也不够简洁，但毕竟是亲生的 接下来是trim和杨辉三角了：
def trim(s): for i in range(len(s)): if not isinstance(s[i],str): raise 'TypeError' while s[:1] == " ": s = s[1:] while s[-1:] == " ": s = s[:-1] return s if trim('hello ') != 'hello': print('测试失败!') elif trim(' hello') != 'hello': print('测试失败!') elif trim(' hello ') != 'hello': print('测试失败!') elif trim(' hello world ') != 'hello world': print('测试失败!') elif trim('') != '': print('测试失败!') elif trim(' ') != '': print('测试失败!') else: print('测试成功!')trim搞定，加了个判断类型的isinstance，杨辉三角…
