在升序数组 nums 中寻找目标值 target,下列程序可以填入的是( )
class Search(object):
def search(self, nums, target):
left, right = 0, len(nums) - 1
while left <= right:
________________________________________
if nums[mid] == target:
return mid
elif nums[mid] > target:
right = mid - 1
else:
left = mid + 1
return -1
mid = (right + left) // 2 + left
mid = (right - left) // 2 + left
mid = (right - left) // 2 -right
mid = (right + left) // 2 - left