一个简单法
查看原帖
一个简单法
992866
fang111125687楼主2024/6/16 16:43

m, n = map(int, input().split()) li = list(map(int, input().split())) cha = list(map(int, input().split())) for n in cha: a = -1 left = 0 right = m-1 while left <= right: mid = (right+left)//2 if li[mid] == n: a = mid+1 right = mid-1 elif li[mid] > n: right = mid-1 else: left = mid + 1 print(a)

2024/6/16 16:43
加载中...