class Solution {

public:

    int minNumberInRotateArray(vector<int> rotateArray) {

        if (rotateArray.size() == )

            return ;

        int low = , high = rotateArray.size() - , mid;

        while (low +  != high)

        {

            mid = low + (high - low) / ;

            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];

    }

};