leetcode 34 二分查找

本来是个很简单的题，前几天看视频也遇到了，两次二分就行，可是就那么亿点细节愣是整了半天。首先是移位，在已知要左移或右移时，应先改变left或者right再动指针。然后就是判别条件，应该是left <= right，这样能进行最后一次操作，之后就会退出，因为移位时是必定要动一位的，所以这种状态只能持续一次，代码如下：

from math import ceil
class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        result = [-1, -1]
        if nums == []: return result

        # 找到元素出现的一个位置
        curr = int(len(nums)/2)
        left, right = 0, len(nums)-1
        while left <= right:
            if nums[curr] == target:
                break
            elif nums[curr] < target:
                left = curr+1
                curr = ceil((curr+right) / 2)
            else:
                right = curr-1
                curr = int((curr+left) / 2)
        if nums[curr] != target: return result

        # 找开始元素
        curr2 = curr
        left, right = 0, curr
        while left <= right:
            if nums[curr2] == target and (curr2 == 0 or nums[curr2-1] != target):
                result[0] = curr2
                break
            elif nums[curr2] == target:
                right = curr2-1
                curr2 = int((curr2+left)/2)
            else:
                left = curr2+1
                curr2 = ceil((curr2+right)/2)
        
        # 找结束元素
        curr2 = curr
        left, right = curr, len(nums)-1
        while left <= right:
            if nums[curr2] == target and (curr2 == len(nums)-1 or nums[curr2+1] != target):
                result[1] = curr2
                break
            elif nums[curr2] == target:
                left = curr2+1
                curr2 = ceil((curr2+right)/2)
            else:
                right = curr2-1
                curr2 = int((curr2+left)/2)

        return result

解法二：快速二分
这个是二分的新思路，让left < right，思考约束问题就变得异常简单，注意mid要靠向动的那边。

from math import ceil
class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        if not nums: return [-1, -1]

        def findFirst(i, nums, l, r):
            while l < r:
                mid = (l+r) // 2
                if nums[mid] < i:
                    l = mid+1
                else:
                    r = mid
            if i != nums[l]: return -1
            return l

        def findLast(i, nums, l, r):
            while l < r:
                mid = ceil((l+r) / 2)
                if nums[mid] > i:
                    r = mid-1
                else:
                    l = mid
            return l

        first = findFirst(target, nums, 0, len(nums)-1)
        if first < 0: return [-1, -1]
        second = findLast(target, nums, first, len(nums)-1)

        return [first, second]