剑指 Offer 11. 旋转数组的最小数字

最新推荐文章于 2024-10-01 23:05:47 发布

萝卜upupup

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量85

点赞数

分类专栏： # 排序&二分查找文章标签：算法 python leetcode

本文链接：https://blog.csdn.net/weixin_43973433/article/details/110388959

版权

排序&二分查找专栏收录该内容

14 篇文章 0 订阅

订阅专栏

剑指 Offer 11. 旋转数组的最小数字

https://leetcode-cn.com/problems/xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof/

class Solution(object):
    def minArray(self, numbers):
        """
        :type numbers: List[int]
        :rtype: int
        """
        if numbers==[]:
            return -1
        n=len(numbers)
        if n==1:
            return numbers[0]
        
        #二分查找
        left=0
        right=n-1
        mid=(left+right)//2
        while numbers[left]>=numbers[right]:
            #print(left,right,mid)
            if left+1==right:
                return numbers[right]
            if numbers[left]==numbers[mid] and numbers[mid]==numbers[right]:#只能顺序查找
                min_val=numbers[left]
                for i in range(left+1,right):
                    if numbers[i]<min_val:
                        min_val=numbers[i]
                return min_val
            if numbers[mid]>=numbers[left]:
                left=mid
            else:
                right=mid
            mid=(left+right)//2
        return numbers[0]

class Solution(object):
    def minArray(self, numbers):
        """
        :type numbers: List[int]
        :rtype: int
        """
        n=len(numbers)
        if n==1:
            return numbers[0]
        
        left=0
        right=n-1
        
        
        while left<right:
            mid=(left+right)//2
            if numbers[mid]>numbers[right]:
                left=mid+1
            elif numbers[mid]<numbers[right]:
                right=mid
            else:
                right-=1
        return numbers[right]