Leetcode -- 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.

class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n = nums.size();
        int left = 0,right = n-1,mid;
        while(left<=right)
        {
            mid = (left+right)/2;
            if(nums[mid]==target) return mid;
            else if(nums[left]<nums[mid])
            {
                if(nums[left]<=target&&target<nums[mid]) right = mid-1;
                else left = mid+1;
            }
            else
            {
                if(nums[mid+1]<=target&&target<=nums[right]) left = mid+1;
                else right = mid-1;
            }
        }
        return -1;
    }
};