LeetCode33：搜索旋转排序数组

旋转数组定义:
升序排列的整数数组，在预先未知的某个点上进行了旋转（例如， [0,1,2,4,5,6,7] 经旋转后可能变为 [4,5,6,7,0,1,2] ）。

思路：变种二分查找
数组被mid分成两半，找到有序的半个数组，如果target比有序数组第一个数大，比有序数组最后一个数小，则在有序数组里找，否则在另一半无序数组里找

class Solution {
    public int search(int[] nums, int target) {
        return search(nums, target, 0, nums.length-1);
    }

    public int search(int[] nums, int target, int begin, int end){
        if (begin == end || begin == end - 1){
            if (nums[begin] == target){return begin;}
            if (nums[end] == target){return end;}
            return -1;
        }

        int mid = (begin+end)/2;
        if (nums[mid] == target){return mid;}

        if (nums[begin] < nums[mid]){
            if (nums[begin] <= target && target <= nums[mid]){
                return search(nums, target, begin, mid);
            } else {
                return search(nums, target, mid, end);
            }
        }else {
            if (nums[mid] <= target && target <= nums[end]){
                return search(nums, target, mid, end);
            } else {
                return search(nums, target, begin, mid);
            }
        }
    }
}