Discuss / Python / 来喽来喽
Back

来喽来喽

Topic source

Han小胖黑洲非

#1 Created at ... [Delete] [Delete and Lock User] 
def findMinAndMax(L):
	if len(L):
		min = L[0]
		max = L[0]
		for i in L:
			if i < min:
				min = i
			if i > max:
				max = i
		return (min, max)
	return (None, None)

if findMinAndMax([]) != (None, None):
    print('测试失败!')
elif findMinAndMax([7]) != (7, 7):
    print('测试失败!')
elif findMinAndMax([7, 1]) != (1, 7):
    print('测试失败!')
elif findMinAndMax([7, 1, 3, 9, 5]) != (1, 9):
    print('测试失败!')
else:
    print('测试成功!')

Han小胖黑洲非

#2 Created at ... [Delete] [Delete and Lock User]

排序法更快 

(￣ェ￣;)

 def findMinAndMax(L):
	if len(L):
		L.sort()
		min = L[0]
		max = L[-1]
		return (min, max)
	return (None, None)

if findMinAndMax([]) != (None, None):
    print('测试失败!')
elif findMinAndMax([7]) != (7, 7):
    print('测试失败!')
elif findMinAndMax([7, 1]) != (1, 7):
    print('测试失败!')
elif findMinAndMax([7, 1, 3, 9, 5]) != (1, 9):
    print('测试失败!')
else:
    print('测试成功!')
  • 1

Reply