260407
No backlinks found.
class Solution: def _search(self, nums: List[int], target:int, start:int, end:int) -> int: mid = (end + start) // 2 # print(start, end, target, mid, nums[mid]) if nums[mid] == target: return mid elif nums[mid] != target and end <= start: return -1 elif nums[mid] > target: return self._search(nums, target, start, mid-1) elif nums[mid] < target: return self._search(nums, target, mid+1, end) else: return -1
def search(self, nums: List[int], target: int) -> int: return self._search(nums, target, 0, len(nums)-1)