三天一题-29-Search in Rotated Sorted Array

题目地址：Search in Rotated Sorted Array
描述：
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]).
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.
Your algorithm’s runtime complexity must be in the order of O(log n).
Example 1:
Input: nums = [4,5,6,7,0,1,2], target = 0
Output: 4
Example 2:
Input: nums = [4,5,6,7,0,1,2], target = 3
Output: -1
说明:
大致意思：给定一个不重复的升序的数组，但是中间进行了旋转，需要满足时间复杂度是logn找到目标值。

import java.util.Arrays;

public class SearchRotatedSortedArray {
    //方法1（不符合题意）：时间复杂度 n
    public static int search(int[] input, int target) {
        int res = -1;
        int len = input.length;
        int i = 0;
        while (input[i] != target && i < len) {
            i++;
        }
        return i == len - 1 ? res : i;
    }

    //方法2（不符合题意）：时间复杂度 logn
    public static int search1(int[] input, int target) {
        int res ;
        int len = input.length;
        //找到中间位置（即旋转处）
        int mid = findMid(input);
        if (target < input[0]) {
            //二进制的查找
            res = binarySearch(input, mid , len - 1, target);
        } else {
            res = binarySearch(input, 0, mid, target);
        }
        return res;
    }

    public static int binarySearch(int[] input, int start, int end, int target) {
        int len = end - start + 1;
        int res = -1;
        while (len > 0 && target != input[start]) {
            len = len >> 1;
            if (input[start + len] <= target) {
                start = start + len;
            }
        }
        return len != 0 ? start : res;
    }

    public static int findMid(int[] ints) {
        int length = ints.length;
        int start = 0, end = length - 1, mid = 0;
        while (start < end) {
            mid = (start + end) >> 1;
            if (ints[mid] > ints[end]) {
                start = mid+1;
            } else {
                end = mid;
            }
        }
        return start;
    }

    public static void main(String[] args) {
        int[] input = {12, 35, 90, 100, 101, 102, 103, 4, 5, 6, 8, 10};
        int target = 8;
        int res = search1(input, target);//方法2（不符合题意）：时间复杂度 logn
        //int res = search(input, target);//方法1（不符合题意）：时间复杂度 n
        System.out.println(res);
    }

}