class Solution { public: int minNumberInRotateArray(vector<int> rotateArray) { int start = 0; int end = rotateArray.size()-1; while(start<end) { int mid = (start+end)/2; if(rotateArray[mid] > rotateArray[end]) { start = mid+1; } else if(rotateArray[mid] < rotateArray[end]) { end = mid; } else{ // mid++; end--; } } return rotateArray[start]; } };