leetcode 154 : Find Minimum in Rotated Sorted Array II

原创于 2015-08-26 17:24:37 发布 · 347 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#旋转有序数组

算法专栏收录该内容

36 篇文章

订阅专栏

本文探讨了在允许重复元素的旋转排序数组中寻找最小值的问题。通过调整二分查找算法来解决此问题，当数组中出现重复元素时，算法能够正确处理并找到最小值。代码示例展示了如何实现这一算法。

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

Follow up for "Find Minimum in Rotated Sorted Array":
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Suppose a sorted array 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.

The array may contain duplicates.

代码

class Solution {
public:
    int findMin(vector<int>& nums) {
        int low=0,high=nums.size()-1,middle;
        while(low<high){
            middle=(low+high)/2;
            if(nums[middle]<nums[high]){
                high=middle;        //不是middle＋1，所以while条件时low<high
            }else if(nums[middle]>nums[high]){
                low=middle+1;
            }else{
                high--;             //比较middle和high位置相等时（低谷和峰值可能存在左边，也可能存在右边），所以high--(middle有保留，所以无影响)
            }
        }
        return nums[high];
    }
};