Leetcode| 704. 二分查找、27. 移除元素 Day1

704. Binary Search - LeetCode

这道题是基础的二分查找，主要有两种写法：左闭右闭和左闭右开。

左闭右闭

左闭右闭的搜索范围是[left, right]，while循环里left == right的情况是合法的，比如[1, 1]，所以if(nums[middle] > target)，right 要赋值为 middle - 1，因为当前这个nums[middle]一定不是target，那么接下来要查找的左区间结束下标位置就是 middle - 1

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

左闭右开

左闭右开的搜索范围是[left, right)，while循环里left == right的情况是不合法的，比如[1, 1)，所以if(nums[middle] > target)，right 要赋值为 middle，即：下一个查询区间不会去比较nums[middle]

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

---

27. Remove Element - LeetCode

暴力解法

两层for循环，一个for循环遍历数组元素 ，第二个for循环更新数组

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        size = len(nums)
        i = 0
        while i < size:
            if nums[i] == val:
                for j in range(i+1, size):
                    nums[j-1] = nums[j]
                i -= 1
                size -= 1
                      
            i += 1

        return size
        

之前参照其他语言的代码用两个for…range()，结果答案错误，原因是Python在for循环中不能修改循环变量i，只能用while替代

# !错误代码：
class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        size = len(nums)
        for i in range(size):
            if nums[i] == val:
                for j in range(i+1, size):
                    nums[j-1] = nums[j]
                i -= 1	# 不会改变循环遍历中的 i
                size -= 1
                      
            i += 1

        return size

快慢双指针

fastIdex负责寻找不是val的值，slowIndex负责生成新的数组

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        # Double index, not change relative positions of elements
        size = len(nums)
        slowIndex = 0
        for fastIndex in range(size):
            if nums[fastIndex] != val:
                nums[slowIndex] = nums[fastIndex]
                slowIndex += 1

        return slowIndex

遍历结束时，slowIndex的坐标正好是新数组的长度，这种方法不会改变数组中元素的相对位置

快慢双指针优化

左右两个指针初始时分别位于数组的首尾，向中间移动遍历该序列
左边等于val的元素 被 右边不等于val的元素 覆盖
这样最多只遍历一遍数组

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        # Double index, change relative positions of elements
        leftIndex = 0
        rightIndex = len(nums) - 1
        while leftIndex <= rightIndex:
            # Find the element on the left that is equal to val
            while(leftIndex <= rightIndex and nums[leftIndex] != val):
                leftIndex += 1

            # Find the element on the right that is not equal to val
            while(leftIndex <= rightIndex and nums[rightIndex] == val):
                rightIndex -= 1

            # Overwrite element on the left that is equal to val with element on the right that is not equal to val 
            if leftIndex < rightIndex:
                nums[leftIndex] = nums[rightIndex]
                leftIndex += 1
                rightIndex -= 1

        return leftIndex

Python remove() 方法

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        while True:
            try:
                nums.remove(val)
            except:
                break
        return len(nums)