【Leet Code】33. Search in Rotated Sorted Array---Hard

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.

思路：

解决该题目的关键就是对二分查找（binary search）进行一些修改，

1）当num[mid] < num[end]时，可以肯定num[mid, ..., end]是升序的，此时如果满足target>num[mid] && target<=num[end],则target肯定在mid的右边，所以beg=mid+1；否则，target一定不在mid的右边，有可能在target的左边（也有可能不存在，但是要对mid的左边进行查找）end = mid -1；

2）否则，可以肯定num[beg, ..., mid]是升序的，此时如果满足target<num[mid] && target>=num[beg]，则target肯定在mid的左边，所以end=mid-1；否则，target一定不在mid的左边，有可能在target的右边（也有可能不存在，但是要对mid的右边进行查找）beg=mid+1。

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