讲解
class Solution:
def search(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums)-1
while(left<=right):
mid = left + (right-left)//2
if nums[mid] > target:
right = mid -1
elif nums[mid] < target:
left = mid + 1
else:
return mid
return -1
class Solution:
def search(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums)
while(left<right):
mid = left + (right-left)//2
if nums[mid] > target:
right = mid
elif nums[mid] < target:
left = mid + 1
else:
return mid
return -1
class Solution:
def removeElement(self, nums: List[int], val: int) -> int:
slow,fast,length = 0,0,len(nums)
while fast < length:
if nums[fast] != val:
nums[slow] = nums[fast]
slow += 1
fast += 1
return slow