def findMinAndMax(L): r=[] n=0 i=1 for n in L: if L[n]<=L[n-i] & L[n]<=L[n+i]: i=i+1 r.append(L(n)) else: n=n+1 for n in L: if L[n]>=L[n-i] & L[n]>=L[n+i]: i=i+1 r.append(L(n)) else: n=n+1 return r
for...in...用错了，回去好好复习一下再来做这道题
Sign in to make a reply
ny12348
def findMinAndMax(L): r=[] n=0 i=1 for n in L: if L[n]<=L[n-i] & L[n]<=L[n+i]: i=i+1 r.append(L(n)) else: n=n+1 for n in L: if L[n]>=L[n-i] & L[n]>=L[n+i]: i=i+1 r.append(L(n)) else: n=n+1 return r