三分查找成品
2025-06-01 07:20:30
发布于:北京
def search(arr, key):
arr.sort()
l = 0
r = len(arr) - 1
while l <= r:
m1 = l + (r - l) // 3
m2 = r - (r - l) // 3
print(l, r, m1, m2)
if key == arr[m1]:
return m1
if key == arr[m2]:
return m2
if key < arr[m1]:
r = m1 - 1
elif key > arr[m1] and key < arr[m2]:
l = m1 + 1
r = m2 - 1
else:
l = m2 + 1
return -1
arr = list(map(int, input().split()))
key = int(input())
print(search(arr, key))
这里空空如也
有帮助,赞一个