33. Search in Rotated Sorted Array

Suppose an array sorted in ascending order 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后要把nums[mid]和nums[high]比较，如果nums[mid]<nums[high]说明后面是排好的，然后看target是不是在后面的范围里，如果是就搜后面，不是就搜前面; else说明前面是排好的，就是看target是不是在前面的范围，如果是就搜前面，不然就搜后面。

细节：边界问题，while的条件是low<=high，不是low<high    mid的取值是(low + high) /2不要加1，会越界。

代码如下：

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