leetcode-Find Minimum in Rotated Sorted Array II-154

和上题一样，本题的序列中可能有重复的元素，不过用上题的代码能过

class Solution {
public:
    int findMin(vector<int>& nums) {
        if(nums.size()==0) return 0;
        int l=0,r=nums.size()-1;
        int key=INT_MAX;
        //int cnt=1;
        while(l<=r){
            //cout<<cnt++<<endl;
            int mid=(l+r)>>1;
            if(nums[mid]<=key){
                key=nums[mid];
            }
            if(nums[l]<nums[mid]){
                if(nums[mid]>nums[r]) l=mid+1;
                else r=mid-1;
            }
            else if(nums[l]>nums[mid]){
                r=mid-1;
            }
            else l++;
        }
        return key;
    }
};