二分法之旋转数组(1)

每日一题ing，今天是个medium题81. Search in Rotated Sorted Array II

class Solution {
public:
    bool search(vector<int>& nums, int target) {
        int len=nums.size();
        if(len==0){
            return false;
        }
        int l=0,r=len-1;
        while(l<=r){
            int mid=(l+r)/2;
            if(target==nums[mid]){
                return true;
            }
            if(nums[l]==nums[mid]){
                l++;
                continue;
            }
            if(nums[l]<nums[mid]){
                if(target<nums[mid]&&target>=nums[l]){
                    r=mid-1;
                }
                else{
                    l=mid+1;
                }
            }
            else{
                if(target>nums[mid]&&target<=nums[r]){
                    l=mid+1;
                }
                else{
                    r=mid-1;
                }
            }
        }
        return false;     
    }
};