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

Your algorithm’s runtime complexity must be in the order of O(log n).

Example 1:

Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4
Example 2:

Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1
题源：here；完整实现：here
思路：
如果要完成时间复杂度O(logn)的算法的话就得用到二分法。幸运的是，在一个有序序列按某个轴反转后我们仍然可以使用二分法，但是需要一些额外判断。
定义如下变量：
nums：输入数组
left：搜索窗口左边界，初始化为0
right：搜索窗口有边界，初始化为nums.size()-1
idx：(left+right)/2
target：目标值

我们可以按照idx的位置及targt的值分为4种情况分别处理：
情况1：nums[idx] >= nums[0] and target < nums[0]
此时有：left = idx+1
情况2：num2[idx] <= nums[right] and target >= nums[0]
此时有：right = idx-1
情况3：nums[idx] >= nums[0] and target >= nums[0]
此时按照一般的二分法处理
情况4：nums[idx] <= nums[right] and target <= nums[right]
此时按照一般的二分法处理
一般的二分法即：
nums[idx] < target: left = idx+1
nums[idx] > target: right = idx-1

代码实现如下：

    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size()-1;

        while (left <= right){
            int idx = (left + right) / 2;
            if (nums[idx] == target) return idx;
            if (nums[idx] >= nums[0] && target < nums[0]) left = idx+1;
            else if (nums[idx] >= nums[0] && target >= nums[0]){
                if (nums[idx] > target) right = idx - 1;
                else left = idx + 1;
            }
            else if (nums[idx] < nums[0] && target < nums[0]){
                if (nums[idx] > target) right = idx - 1;
                else left = idx + 1;
            }
            else right = idx - 1;
        }

        return -1;
    }