leetcode day22 旋转排序数组

最新推荐文章于 2024-06-15 09:23:13 发布

RickyGuo00

最新推荐文章于 2024-06-15 09:23:13 发布

阅读量183

点赞数

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/RickyGuo00/article/details/125838701

版权

day22笔记

- 1.题目描述
- 2.代码构思（debug)

1.题目描述

在这里插入图片描述

2.代码构思（debug)

在这里插入图片描述

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        if not nums:
            return -1

        l, r = 0, len(nums) - 1
        while l <= r:
            mid = (l + r) // 2
            if nums[mid] == target:
                return mid
            if nums[0] <= nums[mid]:
                if nums[0] <= target < nums[mid]:
                    r = mid - 1
                else:
                    l = mid + 1
            else:
                if nums[mid] < target <= nums[len(nums) - 1]:
                    l = mid + 1
                else:
                    r = mid - 1
        return -1

在这里插入图片描述

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        l = 0
        r = len(nums)

        while l < r:
            mid = (l + r) >> 1
            if nums[mid] < target:
                l = mid + 1
            else:
                r = mid 

        pool = l 

        for i in nums[:pool]:
            if i == target:
                return True
        for i in nums[pool:]:
            if i == target:
                return True

        return False

在这里插入图片描述

class Solution:
    def findMin(self, nums: List[int]) -> int:
        low, high = 0, len(nums) - 1
        
        while low < high:
            pivot = low + (high - low) // 2
            if nums[pivot] < nums[high]:
                high = pivot 
            else:
                low = pivot + 1

        return nums[low]