LeetCode 81. Search in Rotated Sorted Array II 搜索旋转排序数组II（Java）

题目：

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., [0,0,1,2,2,5,6] might become [2,5,6,0,0,1,2]).

You are given a target value to search. If found in the array return true, otherwise return false.

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

Example 2:
Input: nums = [2,5,6,0,0,1,2], target = 3
Output: false

Follow up:

• This is a follow up problem to Search in Rotated Sorted Array, where nums may contain duplicates.
• Would this affect the run-time complexity? How and why?

解答：

本题与LeetCode 33题属于同一问题，33题中数组元素不重复，本题中数组元素存在重复情况，所以比如数组[1,1,3,1]这种情况，mid的值与start值相同，则只需要进行去重处理，将strat++，直到移到不同值为止

class Solution {
    public boolean search(int[] nums, int target) {
       if(nums.length == 0)
            return false;        
        int start = 0;
        int end = nums.length-1;        
        while(start<=end){
            int mid = (end+start)/2;            
            if(nums[mid] == target){
                return true;
            }            
            if(nums[mid] > nums[start]){
                if(target >= nums[start] && target < nums[mid]){
                    end = mid-1;
                }else{
                    start = mid + 1;
                }
            }else  if(nums[mid] < nums[start]){
                if(target > nums[mid] && target <= nums[end]){
                    start = mid+1;
                }else{
                    end = mid - 1;
                }
            }else{
                start ++;  //处理重复情况
            }
        }
     return false;
    }
}

附上LeetCode 33 题的解答链接：Search in Rotated Sorted Array 搜索旋转排序数组