題目：把一個(gè)數(shù)組最開始的若干個(gè)元素搬到數(shù)組的末尾，我們稱之為數(shù)組的旋轉(zhuǎn)。輸入一個(gè)遞增排序的數(shù)組的一個(gè)旋轉(zhuǎn)，輸出旋轉(zhuǎn)數(shù)組的最小元素。

先上代碼。

    /**
     * 旋轉(zhuǎn)數(shù)組的最小數(shù)字
     */
    public int minNumberInRotateArray(int [] array) {
        if(array == null || array.length == 0)
            return -1;
        int index1 = 0;
        int index2 = array.length - 1;
        int indexMid = index1;
        while(array[index1] >= array[index2]){
            if(index2 - index1 == 1){
                indexMid = index2;
                break;
            }
            indexMid = (index1 + index2) / 2;
            if(array[index1] == array[indexMid] && array[indexMid] == array[index2]){
                return findMin(array, index1, index2);
            }
            if(array[index1] <= array[indexMid])
                index1 = indexMid;
            else if(array[index2] >= array[indexMid])
                index2 = indexMid;
        }
        return array[indexMid];

    }

    public int findMin(int[] arr, int start, int end){
        int min = arr[start];
        for(int i = start; i <= end; i++){
            if(arr[i] < min)
                min = arr[i];
        }
        return min;
    }