leetcode 33 Search in Rotated Sorted Array

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.

将折叠反转点与mid的位置关系考虑进去来确定两个端点的移动

#include 
#include 
#include 

using namespace std;
class Solution {
public:
    int search(vector& nums, int target) {
        int first=0;
        int last=nums.size()-1;
        while(first<=last)
        {
            int mid=first+(last-last)/2;
                        cout<