問(wèn)題：
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).

Write a function to determine if a given target is in the array.

The array may contain duplicates.

代碼示例：
1、上神器

public class Solution {
    public boolean search(int[] nums, int target) {
        Set<Integer> set = new HashSet<>();
        for (int i : nums) {
            set.add(i);
        }
        return set.contains(target);
    }
}

2、分段討論
將原來(lái)升序數(shù)組的后1部份，移動(dòng)到了前面，可按以下方式2分法處理：

public class Solution {
    public boolean search(int[] nums, int target) {
        int start = 0, end = nums.length - 1, mid = -1;

        while(start <= end) {
            mid = (start + end) / 2;

            if (nums[mid] == target) {
                return true;
            }

            //右側(cè)是排序的或左邊是未排序的
            if (nums[mid] < nums[end] || nums[mid] < nums[start]) {
                if (target > nums[mid] && target <= nums[end]) {
                    start = mid + 1;
                } else {
                    end = mid - 1;
                }
                //左側(cè)是排序的或右邊是未排序的
            } else if (nums[mid] > nums[start] || nums[mid] > nums[end]) {
                if (target < nums[mid] && target >= nums[start]) {
                    end = mid - 1;
                } else {
                    start = mid + 1;
                }
                //重復(fù)部份，++start或--end都可
            } else {
                end--;
            }
        }
        return false;
    }
}