搜索旋转排序数组

class Solution {
public:
    int Find(int target,int l,int r,vector<int>& nums)
    {
        int mid;
        int d=-1;
        while(l<=r)
        {
            mid=(l+r)>>1;
            if(nums[mid]==target)
            {
                d=mid;
                break;
            }
            else if(nums[mid]>target)
            {
                r=mid-1;
            }
            else l=mid+1;
        }
        return d;
    }
    int check(int l,int r,vector<int>& nums,int target)
    {
        int mid=(l+r)>>1;
        if(nums[mid]>=nums[l])
        {
            if(target>=nums[l]&&target<=nums[mid])
            {
                int k=Find(target,l,mid,nums);
                if(k!=-1) return k;
            }
            if(mid+1<=r) return check(mid+1,r,nums,target);
        }
        else
        {
            if(target>=nums[mid]&&target<=nums[r])
            {
                int k=Find(target,mid,r,nums);
                if(k!=-1) return k;
            }
            if(l<=mid-1) return check(l,mid-1,nums,target);
        }
        return -1;
    }
    int search(vector<int>& nums, int target) {
        int n=nums.size();
        if(n==0) return -1;
        return check(0,n-1,nums,target);
        

        
    }
};