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.

分析：

和之前那个题一毛一样。。

代码：

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