[LeetCode] Find Minimum in Rotated Sorted Array II

hale1007

于 2014-10-22 18:15:56 发布

阅读量384

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Algorithm

本文链接：https://blog.youkuaiyun.com/hale1007/article/details/40380281

Algorithm 同时被 2 个专栏收录

86 篇文章

订阅专栏

LeetCode

76 篇文章

订阅专栏

本文探讨了在包含重复元素的旋转排序数组中查找最小元素的方法，分析了时间复杂度的变化，并提供了相应的算法实现。

摘要生成于 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> &num) {
        int left = 0, right = num.size() - 1;
        while(left < right && num[left] >= num[right])
        {
            int middle = left + (right - left) / 2;
            if(num[middle] > num[right])
                left = middle + 1;
            else if(num[middle] < num[left])
                right = middle;
            else
                left += 1;
        }
        return num[left];
    }
};