Sword To Offer 006 - 旋转数组的最小数字

class Solution {
public:
    int minNumberInRotateArray(const vector<int> &rotateArray) {
        if(rotateArray.empty()) {
            return 0;
        }
        int left = 0;
        int right = rotateArray.size() - 1;
        while(left < right) {
            int mid = (left + right) >> 1;
            if(rotateArray[mid] < rotateArray[right]) {
                right = mid;
            } else if (rotateArray[mid] > rotateArray[right]) {
                left = mid + 1;
            } else {
                if(rotateArray[left] == rotateArray[right]) {
                    left++, right--;
                } else {
                    right = mid;
                }
            }
        }
        return rotateArray[right];
    }
};