class Solution { public: int minNumberInRotateArray(vector<int> rotateArray) { return FindMin(rotateArray, 0, rotateArray.size() - 1); } private: int FindMin(vector<int>& arr, int l, int r) { while (l <= r) { if (r - l <= 1) return arr[l] > arr[r] ? arr[r] : arr[l]; int mid = ((...