数组篇

704. 二分查找

class Solution:def search(self, nums: List[int], target: int) -> int:left = 0right = len(nums) - 1while(left <= right):mid = (left + right) // 2if nums[mid] == target:return midelif nums[mid] > target:right = mid - 1elif nums[mid] < target:left = mid + 1return -1

27. 移除元素

class Solution:def removeElement(self, nums: List[int], val: int) -> int:i = 0j = 0while(j < len(nums)):if nums[j] != val:nums[i] = nums[j]i += 1j += 1return i#快慢指针
#没碰到删除的值，快慢指针都移动，并且赋值
#碰到删除的值，只动快指针，并且不赋值