剑指Offer:旋转数组的最小数字

/************************************************************************/
/*
    题目：把一个数组最开始的若干个元素搬到数组的末尾，我们称之为数组的旋转。
    输入一个递增排序数组的旋转，输出旋转数组的最小元素。
    例子：
        数组[3,4,5,1,2]为[1,2,3,4,5]的一个旋转，该数组的u最小数字为1。
*/
/************************************************************************/
int Min(int* numbers, int length) {
    if (numbers == NULL || length <= 0) {
        throw new std::exception("Invalid parameters.");
    }

    int index1 = 0;
    int index2 = length - 1;
    int indexMid = index1;

    while (numbers[index1] >= numbers[index2]) {
        if (index2 - index1 == 1) {
            indexMid = index2;
            break;
        }

        indexMid = (index1 + index2) / 2;
        if (numbers[indexMid] >= numbers[index1]) {
            index1 = indexMid;
        }
        else if (numbers[indexMid] <= numbers[index2]) {
            index2 = indexMid;
        }
    }
    return numbers[indexMid];
}
//下面要处理一种特例：
//[1,0,1,1,1],这时，我们的、index1\index2\indexMid指向的值均为1，
//出现无法判断indexMid是在左边的递增序列还是右边的递增序列，傻傻分不清楚
//所以，一个个的顺序查找吧
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;
}
int Min1(int* numbers, int length) {
    if (numbers == NULL || length <= 0) {
        throw new std::exception("Invalid parameters.");
    }

    int index1 = 0;
    int index2 = length - 1;
    int indexMid = index1;

    while (numbers[index1] >= numbers[index2]) {
        if (index2 - index1 == 1) {
            indexMid = index2;
            break;
        }

        indexMid = (index1 + index2) / 2;

        //如果下标为index1和index2和indexMid的指向的三个元素相等，则只能顺序查找
        if (numbers[index2] == numbers[index1] && numbers[index2] == 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];
}