LeetCod之Search in Rotated Sorted Array （C++）

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).

You are given a target value to search. If found in the array return its index, otherwise return -1.

You may assume no duplicate exists in the array.
问题说明：在一个有序数组旋转后的数组中查找一个数，存在返回位置，不存在返回-1.

int search(vector<int>& nums, int target) {
        vector<int> a=nums;
    sort(a.begin(),a.end());
    auto firstfind=find(a.begin(),a.end(),nums[0]);
    int m=a.end()-firstfind;//m为旋转数组的位置
    int nu=0;
    if (nums[0]<=target)
    {
        nu=findx(nums.begin(),nums.begin()+m,target);
        if (nu<0)
        {
            return -1;
        }
        else
        {
            return nu;
        }
    }
    else
    {
        nu=findx(nums.begin()+m,nums.end(),target);
        if (nu<0)
        {
            return -1;
        }
        else
        {   
            return (m+nu);
        }
    }   
    }

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)==target)
    {
        return a;
    }
    else
    {
        return -1;
    }

}

先找到旋转的数组的位置，然后根据首尾元素与查询元素的对比选定在哪个部分进行查找。