LeetCode153：Find Minimum in Rotated Sorted Array

最新推荐文章于 2025-05-20 18:03:40 发布

励志学好数据结构

最新推荐文章于 2025-05-20 18:03:40 发布

阅读量164

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/mengmengdajuanjuan/article/details/84617526

LeetCode 专栏收录该内容

186 篇文章

订阅专栏

本文介绍了一种算法，用于在未知旋转点的升序数组中查找最小元素。通过对比示例，如[3,4,5,1,2]和[4,5,6,7,0,1,2]，展示了如何使用二分搜索法高效解决此问题。代码示例使用Python实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).

Find the minimum element.

You may assume no duplicate exists in the array.

Example 1:

Input: [3,4,5,1,2] 
Output: 1

Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

LeetCode：链接

LeetCode变体：LeetCode154：Find Minimum in Rotated Sorted Array II

和剑指Offer_编程题06：旋转数组的最小数字(指针)思路是一样的。这题因为没有重复数字，所以比剑指offer的题要简单一点。但是边界问题我实在是弄不清楚，所以就和剑指offer的题用了同样的代码。

class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:
            return None
        low = 0
        high = len(nums) - 1
        while low <= high:
            mid = (low + high) // 2
            if nums[mid] > nums[high]:
                low = mid + 1
            elif nums[mid] < nums[high]:
                high = mid
            else:
                high -= 1
        return nums[low]