[leetcode]Find Minimum in Rotated Sorted Array II

最新推荐文章于 2024-11-13 08:49:23 发布

Cabinathor

最新推荐文章于 2024-11-13 08:49:23 发布

阅读量292

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.csdn.net/lmxmimihuhu/article/details/47165807

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

探讨在允许重复元素的旋转排序数组中查找最小值的方法。通过递归与迭代结合的方式解决因重复元素带来的复杂性问题。

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

From : https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/

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 start=0, end=nums.size()-1;
        while(start <= end) {
            int mid = (start+end)>>1;
            if(nums[mid] == nums[start] && nums[mid] == nums[end]) {
                return findMin(nums, start, end);
            } else if(nums[mid] >= nums[start] && nums[start] >= nums[end]) {
                start = mid+1;
            } else {
                end = mid;
            }
        }
        return 0;
    }
    
    int findMin(vector<int>& nums, int start, int end) {
        int res = nums[start];
        for(int i=start+1; i<=end; ++i) {
            if(nums[i] < res) {
                return nums[i];
            } else if(nums[i] > res) {
                while(i < end) {
                    if(nums[i] > nums[i+1]) {
                        return nums[i+1];
                    }
                    ++i;
                }
            }
        }
        return res;
    }
};