[LeetCode]Search in Rotated Sorted ArrayI＆II

假设按照升序排序的数组在预先未知的某个点上进行了旋转。

( 例如，数组 [0,0,1,2,2,5,6] 可能变为 [2,5,6,0,0,1,2] )。

编写一个函数来判断给定的目标值是否存在于数组中。若存在返回 true，否则返回 false。

示例 1:

输入: nums = [2,5,6,0,0,1,2], target = 0
输出: true
示例 2:

输入: nums = [2,5,6,0,0,1,2], target = 3
输出: false

class Solution {
    public boolean search(int[] nums, int target) {
	        int length = nums.length;
	        int left = 0;
	        int right = length-1;
	        while (right >= left) {
	        	int mid = left + (right-left)/2;
	        	if (nums[mid] == target)
	        		return true;
	        	if (nums[mid] > nums[right]) {
	        		if (target >= nums[left] && target < nums[mid])
	        			right = mid-1;
	        		else
	        			left = mid+1;
	        	}
	        	else if (nums[mid] < nums[right]) {
	        		if (target <= nums[right] && target > nums[mid])
	        			left = mid+1;
	        		else
	        			right = mid-1;
	        	}
                else {
                    right--;
                }                               
	        }
	        return false;
	    }
}

数组翻转后的顺序需要通过nums[mid]和nums[right]或者nums[left]的比较来判断。有无重复元素只需加一个判断，即当nums[mid] == nums[right]的时候，right–跳过重复元素即可。