旋转数组问题的通用思想

Chili868

已于 2022-09-11 15:18:13 修改

阅读量132

点赞数

分类专栏： leetcode 文章标签： leetcode 算法数据结构

于 2022-09-11 14:41:24 首次发布

本文链接：https://blog.csdn.net/AAUfoa/article/details/126805166

版权

leetcode 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

33. 搜索旋转排序数组

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = left + (right - left) // 2
            if nums[mid] == target: # 符合条件
                return mid
            if nums[mid] > nums[left]:  # 左边是有序的
                if nums[mid] < target:
                    left = mid + 1
                elif nums[mid] > target: 
                    if target >= nums[left]:
                        right = mid - 1
                    else:
                        left = mid + 1
            elif nums[mid] < nums[left]: # 右边是有序的
                if nums[mid] > target:
                    right = mid - 1
                else:
                    if target <= nums[right]:
                        left = mid + 1
                    else:
                        right = mid - 1
            else:
                left += 1
        return -1

81. 搜索旋转排序数组 II

class Solution:
    def search(self, nums: List[int], target: int) -> bool:
        if not nums:
            return False
        
        n = len(nums)
        if n == 1:
            return nums[0] == target
        
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = left + (right - left) // 2
            if nums[mid] == target: # 符合条件
                return True
            if nums[mid] > nums[left]:  # 左边是有序的
                if nums[mid] < target:
                    left = mid + 1
                elif nums[mid] > target: 
                    if target >= nums[left]:
                        right = mid - 1
                    else:
                        left = mid + 1
            elif nums[mid] < nums[left]: # 右边是有序的
                if nums[mid] > target:
                    right = mid - 1
                else:
                    if target <= nums[right]:
                        left = mid + 1
                    else:
                        right = mid - 1
            else:
                left += 1
        return False

153. 寻找旋转排序数组中的最小值

class Solution:
    def findMin(self, nums: List[int]) -> int:

        left, right = 0, len(nums) - 1 
        res = float('inf')
        while left<=right:
            mid = left + (right - left)//2
            res = min(res, nums[mid])
            if nums[mid] < nums[left]: # 右边是有序的
                res = min(res, nums[mid])
                right = mid - 1
            else:  # 左边是有序的，说明旋转点在右边
                res = min(res, nums[left])
                left = mid + 1
        return res