bool search(vector<int>& nums, int target) 
{
    int start = 0, end = nums.size() - 1;
    while (start <= end) 
    {
        int mid = (end + start) / 2;
        if (nums[mid] == target)
            return true;
        if (nums[mid] < nums[end]) 
        {
            if (nums[mid] < target && target <= nums[end])
            {
                start = mid + 1;
            }
            else
            {
                end = mid - 1;
            }
        }
        else if (nums[mid] > nums[end]) 
        {
            if (nums[start] <= target && target < nums[mid])
            {
                end = mid - 1;
            }
            else
            {
                start = mid + 1;
            }
        }
        else
        {
            end--;
        }
    }
    return false;
}

//人生真理
return find(nums.begin(), nums.end(), target) == nums.end() ? false : true;