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.


O(n)的方法

找到有序的一边,然后取min即可。

关键就是找到rotate list有序的那一边


循环实现:

class Solution {
public:
    int findMin(vector<int> &num) {
        return find(num,0,num.size()-1);
    }
    int find(vector<int> &num,int left,int right){
        if(left==right)
            return num[left];
        int mi = INT_MAX;
        while(left<=right){
            int mid = (left+right)/2;
            int i=mid,j=mid;
            while(i>=left && num[i]==num[mid])
                i--;
            while(j<=right && num[j]==num[mid])
                j++;
            mi = min(mi,num[mid]);
            if(i<left){
                if(j>right){
                    break;
                }else
                    left = j;
            }else{
                if(j>right)
                    right = i;
                else{
                    if(num[left]<=num[i]){
                        mi = min(num[left],mi);
                        left = j;
                    }else{
                        mi = min(num[j],mi);
                        right = i;
                    }
                }
            }
        }
        return mi;
    }
};


递归实现:

class Solution {
public:
    int findMin(vector<int> &num) {
        return find(num,0,num.size()-1);
    }
    int find(vector<int> &num,int left,int right){
        if(left==right)
            return num[left];
        
            int mid = (left+right)/2;
            int i=mid,j=mid;
            while(i>=left && num[i]==num[mid])
                i--;
            while(j<=right && num[j]==num[mid])
                j++;
            if(i<left){
                if(j>right)
                    return num[mid];
                return min(num[mid],find(num,j,right));
            }else{
                if(j>right)
                    return min(num[mid],find(num,left,i));
                if(num[left]<=num[i]){
                    return min(num[mid],min(num[left],find(num,j,right)));
                }else{
                    return min(num[mid],min(num[j],find(num,left,i)));
                }
            }
        
    }
};



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值