classSolution{publicintsearch(int[] nums,int target){int left =0, right = nums.length -1;while(left <= right){int mid =(right - left)/2+ left;int num = nums[mid];if(num == target){return mid;}elseif(num > target){
right = mid -1;}else{
left = mid +1;}}return-1;}}
classSolution:defsearch(self, nums: List[int], target:int)->int:
left, right =0,len(nums)-1while left <= right:
mid =(right - left)//2+ left
num = nums[mid]if num == target:return mid
elif num > target:
right = mid -1else:
left = mid +1return-1