LeetCode OJ 33 Search in Rotated Sorted Array

难度：hard

由此可见leetcode的hard难度比较于acm是偏简单一些的。

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.

解题思路：采用二分法查找是核心。由于数列的变换是在有序数列的基础上，则假如在二分时若一半无序则另一半会有序，判断逻辑放在有序的一侧即可。注意边界值，不要迷信AC的案例代码，因为我个人测试过一些ac代码在边界情况时会出现错误。

代码如下：

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

运行时间：4ms