leetcode33+Search in Rotated Sorted Array

https://leetcode.com/problems/search-in-rotated-sorted-array/

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left=0, right=nums.size()-1;
        int mid=0;
        while (left<=right) {
            mid=(left+right)/2;
            if(nums[mid]==target) return mid;
            else if(nums[mid]>=nums[left]){//和nums[left]进行比较
                if(nums[left]<=target&&target<nums[mid]) right=mid-1; //target和nums[left] nums[mid]比较
                else left=mid+1;
            }
            else if(nums[mid]<nums[left]){//在右半截
                if(nums[mid]<target&&target<=nums[right]) left=mid+1; //target和nums[mid]nums[right]比较
                else right=mid-1;
            }
        }
        return -1;
    }
};