class Solution:
def search(self, nums: List[int], target: int) -> int:
left, right = 0, len(nums) - 1
while left <= right:
pivot = left + (right - left) // 2
if nums[pivot] == target:
return pivot
if target < nums[pivot]:
right = pivot - 1
else:
left = pivot + 1
return -1
class Solution:
def search(self , nums , target ):
# write code here
if not nums: return -1
i, j = 0, len(nums)-1
while i < j:
mid = (i+j) // 2
if nums[mid] < target: i = mid + 1
else: j = mid
return i if nums[i] == target else -1