leetcode Find Minimum in Rotated Sorted Array II

最新推荐文章于 2025-11-26 16:04:28 发布

原创最新推荐文章于 2025-11-26 16:04:28 发布 · 319 阅读

0 ·

CC 4.0 BY-SA版权

leetcode Fighting 专栏收录该内容

133 篇文章

订阅专栏

本文介绍了一种在已旋转的升序数组中查找最小元素的方法。通过使用C++实现的二分查找算法，该算法能在O(log n)的时间复杂度内找到最小值。文章提供了完整的代码示例并解释了关键步骤。

参考

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

代码

class Solution {
public:
    int findMin(vector<int> &num) {
        
        if(num.size()==0)  
        return 0;  
        int l = 0;  
        int r = num.size()-1;  
        int minNum = num[0];  
        while(l<r-1)  
        {  
            int m = (l+r)/2;  
            if(num[l]<num[m])  
            {  
                minNum = min(num[l],minNum);  
                l = m+1;  
            }  
            else if(num[l]>num[m])  
            {  
                minNum = min(num[m],minNum);  
                r = m-1;  
            }  
            else  
            {  
                l++;  
            }  
        }  
        minNum = min(num[r],minNum);  
        minNum = min(num[l],minNum);  
        return minNum;  
 }
};