LeetCode之Search in Rotated Sorted Array II （）C++

Follow up for “Search in Rotated Sorted Array”:
What if duplicates are allowed?

Would this affect the run-time complexity? How and why?

Write a function to determine if a given target is in the array.
问题说明：与旋转数组1的问题不同，这个含有从父元素，且个数不确定。

 bool search(vector<int>& nums, int target) {
      int m;
    int i=0;
    for (;i<nums.size()-1;++i)
    {
        if (nums[i]<=nums[i+1])
        {
            m=i+1;
        }
        else
        {
            break;
        }
    }
    m=i+1;
//  auto firstfind=find(a.begin(),a.end(),nums[0]);
    //int m=a.end()-firstfind;
    int nu=0;

    if (nums[0]<=target)
    {
        nu=findx(nums.begin(),nums.begin()+m,target);
        if (nu<0)
        {
            return false;

        }
        else
        {
            return true;
        }
    }
    else
    {
        nu=findx(nums.begin()+m,nums.end(),target);
        if (nu<0)
        {
            return false;
        }
        else
        {

            return true;
        }

    }
    }

int findx(vector<int>::iterator beginn,vector<int>::iterator endd,int target)
{

    int a=0;
    int b=endd-beginn-1;
    if (b<0)
    {
        return -1;
    }
    while(a<=b)
    {
        int mid=(a+b)/2;
        if (*(beginn+mid)>=target)
        {
            b=mid-1;
        }
        else
        {
            a=mid+1;
        }

    }
    if ((beginn+a)<endd&&(*(beginn+a)==target))
    {
        return a;
    }
    else
    {
        return -1;
    }

}