def _Max(L): m=len(L) if m==0: return None n=0 max=L[0] while n<m: if max < L[n]: max=L[n] n=n+1 return max
def _Min(L): m=len(L) if m==0: return None n=0 min=L[0] while n<m: if min > L[n]: min=L[n] n=n+1 return min
def findMinAndMax(L): return _Min(L),_Max(L)
if findMinAndMax([]) != (None, None): print('测试失败!'+'1') elif findMinAndMax([7]) != (7, 7): print('测试失败!'+'2') elif findMinAndMax([7, 1]) != (1, 7): print('测试失败!'+'3') elif findMinAndMax([7, 1, 3, 9, 5]) != (1, 9): print('测试失败!'+'4') else: print('测试成功!')
Sign in to make a reply
何苦来哉ooo
def _Max(L): m=len(L) if m==0: return None n=0 max=L[0] while n<m: if max < L[n]: max=L[n] n=n+1 return max
def _Min(L): m=len(L) if m==0: return None n=0 min=L[0] while n<m: if min > L[n]: min=L[n] n=n+1 return min
def findMinAndMax(L): return _Min(L),_Max(L)
测试
if findMinAndMax([]) != (None, None): print('测试失败!'+'1') elif findMinAndMax([7]) != (7, 7): print('测试失败!'+'2') elif findMinAndMax([7, 1]) != (1, 7): print('测试失败!'+'3') elif findMinAndMax([7, 1, 3, 9, 5]) != (1, 9): print('测试失败!'+'4') else: print('测试成功!')