LeetCode刷题（python3）|day01 数组基础

LeetCode 704-二分查找

右边界为len(nums) - 1 ，而不是len(nums)
python整除向下取整为 // 而不是 /

未熟悉左闭右开，左闭右闭 两种区间规则 写出来的二分法

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

LeetCode 27-移除元素

使用count统计数组中等于目标值的数量
work相当于当前工作指针，若work下标指向的数等于目标值，则count加一，否则将不等于目标的数向前挪到work-count下标处
还可使用快慢指针法

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        count = 0
        work = 0
        for work in range(0,len(nums)):
            if(nums[work] == val):
                count += 1
            elif count > 0:
                nums[work - count] = nums[work]
        
        return len(nums) - count