习题练习，为什么我的代码这么麻烦
Topic source
#借鉴后改
def findMinAndMax(L):
if len(L) == 0:
return None,None
else:
min_l = L[0]
max_l = L[0]
for i in L:
if i <= min_l:
min_l = i
for x in L:
if x >= max_l:
max_l = x
return min_l,max_l
- 1
#借鉴后改
def findMinAndMax(L):
if len(L) == 0:
return None,None
else:
min_l = L[0]
max_l = L[0]
for i in L:
if i <= min_l:
min_l = i
for x in L:
if x >= max_l:
max_l = x
return min_l,max_l
用户6177674467
def findMinAndMax(L):
min_l = None
max_l = None
if L:
if len(L) == 1:
min_l = max_l = L[0]
return min_l,max_l
else:
i = 0
while i <len(L)-1:
if L[i] >= L[i + 1]:
min_l = L[i + 1]
else:
a = L[i]
L[i] = L[i+1]
L[i+1]=a
min_l = L[i+1]
i += 1
n = 0
while n < len(L)-1:
if L[n] < L[n + 1]:
max_l = L[n + 1]
else:
b = L[n]
L[n] = L[n + 1]
L[n + 1] = b
max_l = L[n+1]
n += 1
else:
return (None,None)
return min_l, max_l