leetcode Search in Rotated Sorted Array

代码：

#include<iostream>
#include<vector>

using namespace std;

int search(vector<int>& nums, int target) 
{
    int L = nums.size();
    int k = 0;
    int min = nums[0];
    for (int i = 1; i < L; i++)
    {
        if (nums[i] < min)
        {
            min = nums[i];
            k = i;
        }
    }
    int left, right;
    if (target>nums[L - 1])
    {
        left = 0;
        right = k - 1;
    }
    else
    {
        left = k;
        right = L - 1;
    }
    while (left <= right)
    {
        int mid = (left + right) / 2;
        if (target < nums[mid])
        {
            right = mid - 1;
        }
        else if (target > nums[mid])
        {
            left = mid + 1;
        }
        else
        {
            return mid;
        }
    }
    return -1;
}

int main()
{
    vector<int> a = {4, 5, 6, 7, 0};
    cout << search(a, 0) << endl;
}