【Leetcode】Find Minimum in Rotated Sorted Array II

yyz20002008

于 2014-11-10 04:56:22 发布

阅读量219

点赞数

文章标签： leetcode Java array binary search

本文探讨了在包含重复元素的旋转排序数组中查找最小元素的问题，并分析了此类情况如何影响运行时间复杂度。详细介绍了算法调整以适应重复元素的情况。

摘要生成于 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.

http://blog.youkuaiyun.com/linhuanmars/article/details/40449299

public int findMin(int[] num) {  
    if(num == null || num.length==0)  
        return 0;  
    int l = 0;  
    int r = num.length-1;  
    int min = num[0];  
    while(l<r-1)  
    {  
        int m = (l+r)/2;  
        if(num[l]<num[m])  
        {  
            min = Math.min(num[l],min);  
            l = m+1;  
        }  
        else if(num[l]>num[m])  
        {  
            min = Math.min(num[m],min);  
            r = m-1;  
        }  
        else  
        {  
            l++;  
        }  
    }  
    min = Math.min(num[r],min);  
    min = Math.min(num[l],min);  
    return min;  
}