class Solution {
public:
    int minNumberInRotateArray(vector<int> rotateArray) {
        if (rotateArray.size() == 0)
            return 0;
        int low = 0, high = rotateArray.size() - 1, mid;
        while (low + 1 != high)
        {
            mid = low + (high - low) / 2;
            if (rotateArray[mid] == rotateArray[low] && rotateArray[mid] ==rotateArray[high])
            {
                int tempmin = rotateArray[low];
                for (int i = low ; i <= high; i++ )
                {
                    if (rotateArray[i] < tempmin)
                    {
                        tempmin = rotateArray[i];
                    }
                }
                return tempmin;
            }
            if (rotateArray[mid] >= rotateArray[low])
            {
                low = mid;   
            }
            if (rotateArray[mid] <=rotateArray[high])
            {
                high = mid;   
            }
        }
        return rotateArray[high];
    }
};