Leetcode每日一题:33.search-in-rotated-sorted-array(搜索旋转排序数组)

思路：利用vector变长特性，将前面旋转的部分移到后面，然后二分查找,O(logn)复杂度

int search(vector<int> &nums, int target)
{
    int len = nums.size();
    int right = len-1, left = 0;
    //boundary condition
    if (len == 0)
        return -1;
    if (len == 1)
    {
        if (nums[0] == target)
            return 0;
        else
            return -1;
    }

    for (int i = 0; i < len - 1; i++)
    {
        //firstly ,find the rotated point
        if (nums[i] > nums[i + 1])
        {
            nums.push_back(nums[i]);
            right = nums.size()-1;
            left = i + 1;
            break;
        }
        nums.push_back(nums[i]);
    }

    //binary_search
    while (left < right)
    {
        int mid = (left + right) / 2;
        if (target == nums[mid])
        {
            left=mid;
            break;
        }
        else if (target > nums[mid])
        {
            left = mid + 1;
        }
        else
        {
            right = mid - 1;
        }
    }

    //if we can not find the target in the vector, return -1
    if (nums[left] != target)
        return -1;
    //transfer the left to index
    return left >= len ? left - len : left;
}