策略二：两分查找 ·猜数游戏：可取的策略？ 两分查找：每次查看有序列表的中点数据，根据 情况接着查找较大一半或较小一半. def search(x,nums): low,high 0,len(nums)-1 while low <high: mid (low high)/2 if x =nums [mid] return mid elif x nums [mid]: high mid -1 else: low mid 1 return -1 Lu Chaojun,SJTU 4Lu Chaojun, SJTU 4 策略二:两分查找 • 猜数游戏:可取的策略? • 两分查找:每次查看有序列表的中点数据,根据 情况接着查找较大一半或较小一半. def search(x, nums): low, high = 0, len(nums) - 1 while low <= high: mid = (low + high) / 2 if x == nums[mid]: return mid elif x < nums[mid]: high = mid - 1 else: low = mid + 1 return -1