704. 二分查找
704. 二分查找 - 力扣（LeetCode）
class Solution:def search(self, nums: List[int], target: int) -> int:left, right = 0,len(nums) - 1while left <= right:middle = (right + left) // 2num = nums[middle]if num < target:left = middle + 1elif num > target:right = middle - 1else:return middlereturn -1