leetcode-旋转数组相关题目解答

最新推荐文章于 2024-05-08 20:54:14 发布

github_元宝

最新推荐文章于 2024-05-08 20:54:14 发布

阅读量303

点赞数

分类专栏：刷题文章标签： leetcode

本文链接：https://blog.csdn.net/github_39605284/article/details/121908793

版权

刷题专栏收录该内容

9 篇文章 0 订阅

订阅专栏

33. 搜索旋转排序数组

class Solution(object):
    def search(self, nums, target):
        left, right = 0, len(nums)-1

        while left <= right:
            mid = (left+right)//2
            
            if nums[mid] == target:
                return mid
            
            if nums[left] <= nums[mid]:
                if  nums[left] <= target <= nums[mid]:
                    right = mid-1
                else:
                    left = mid+1
            else:
                if nums[mid] <= target <= nums[right]:
                    left = mid+1
                else:
                    right = mid-1
            
        return -1

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

class Solution(object):
    def findMin(self, nums):
        left, right = 0, len(nums)-1

        while left<=right:
            mid = left + (right - left)//2
            if right -left <=1: return min(nums[left], nums[right])
            if nums[right] > nums[mid]:
                right = mid
            elif nums[right] < nums[mid] :
                left = mid+1
        return  nums[left]

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

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