在旋转数组中寻找一个数字

searchInRotatedArray.cpp

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