二分查找C++

class Solution {

public:

int search(vector<int>& nums, int target) {

int left = 0;

int right = nums.size()-1;

while(nums[left] <= nums[right])

{

int middle = (left + right)/2;

if (nums[middle] > target)

{

right = middle-1;

}

else if(nums[middle] < target)

{

left = middle+1;

}

else

return middle;

}

return -1;

}

};