笔记 旋转数组中的最小值

总结

定义两个index，一个从前往后，初始化为首，记为index1，一个从后往前，初始化为尾，记为index2

定义一个中间indexMid，如果中间index大于首的index，将首index移至中间index；如果中间index小于尾的index，将尾index移到中间index

考虑特殊情况，三个index相等的情况，那么这时候就只能顺序查找

考虑另一特殊情况，如果所有数均相等，那么应该如何判定最小呢

package minNumberInRotatedArray;

public class OriCode_MinInRotatedNumber {
    public static void main(String[] args) {
//      int[] numbers = { 3, 4, 5, 1, 2 };
//      int[] numbers = { 1, 0, 1, 1, 1 };
        int[] numbers={1,1,1,0,1};
        int result = Min(numbers);

        System.out.println(result);

    }

    static int Min(int[] numbers) {
        int index1 = 0;
        int index2 = numbers.length - 1;
        int indexMid = index1;
        while (numbers[index1] >= numbers[index2]) {
            if (index2 - index1 == 1) {
                indexMid = index2;
                break;
            }
            indexMid = (index1 + index2) / 2;
            if (numbers[index1] == numbers[index2]
                    && numbers[index1] == numbers[indexMid]) {
                return MinInOrder(numbers, index1, index2);
            }
            if (numbers[indexMid] >= numbers[index1]) {
                index1 = indexMid;
            } else if (numbers[indexMid] <= numbers[index2]) {
                index2 = indexMid;
            }

        }
        return numbers[indexMid];

    };

    static int MinInOrder(int[] numbers, int index1, int index2) {
        int result = numbers[index1];
        for (int i = index1 + 1; i < index2; i++) {
            if (result > numbers[i]) {
                result = numbers[i];
            }
        }
        return result;

    }
}