剑指offer-旋转数组的最小数字

class Solution {
public:
    int minNumberInRotateArray(vector<int> numbers) {
        if(numbers.size() == 0)
        {
            return 0;
        }
        int index1 = 0;
        int index2 = numbers.size() - 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[indexMid] == numbers[index1])
        {
            int result = numbers[index1];
            for(int i = index1 + 1;i <= index2;++i)
            {
                result = max(result,numbers[i]);
            }
            return result;
        }
        if(numbers[indexMid] >= numbers[index1])
            index1 = indexMid;
        else if(numbers[indexMid] <= numbers[index2])//必须要有等于号
            index2 = indexMid;
    }
 
    return numbers[indexMid];
}

};