Java查找旋转数组的最小元素

这道题目本来遍历解决就已经可以，但是又有人说二分也可以

后来因为变换莫测的数据，这两个结合在了一起

当头=尾=中时，用遍历

不是，用二分

如果实在抽象难理解，多用几组数据，调试一下就知道怎么回事了

如果数据本身不是旋转的，这个程序就不适用

代码实现：

    private static List numbers = Arrays.asList(3,4,5,1,2);
    private static int min(List numbers, int length) throws Exception {
        if(null == numbers || length == 0){
            throw new Exception("invalid parameters");
        }

        int right = 0;
        int left = length - 1;
        int tempIdex = right;
        while(right <= left){
            if(right == (left - 1)){
                return numbers.get(left);
            }

            int mid = (right + left) / 2;
            if(numbers.get(right).equals(numbers.get(mid)) && numbers.get(right).equals(numbers.get(left))){
                return sequentialSearch(numbers, right, left);
            } else if(numbers.get(right) <= numbers.get(mid)){
                right = mid;
            } else if(numbers.get(left) >= numbers.get(mid)){
                left = mid;
            }
        }
        return numbers.get(right);
    }

    private static int sequentialSearch(List numbers, int right, int left){
        int index = numbers.get(right);
        for(int i = index + 1; i <= left; i++){
            if(index > numbers.get(i)){
                index = numbers.get(i);
            }
        }
        return index;
    }