剑指Offer——旋转数组的最小数字

 1 class Solution {
 2 public:
 3     int minNumberInRotateArray(vector<int> rotateArray) {
 4         int Len = rotateArray.size();
 5         if(Len == 0) return 0;
 6         int left = 0, right = Len - 1, mid;
 7         while(left <= right) {
 8             mid = (left + right) >> 1;
 9             int leftNum = rotateArray[left];
10             int rightNum = rotateArray[right];
11             int midNum = rotateArray[mid];
12             if(leftNum < rightNum) return leftNum;
13             if(midNum > rightNum)
14                 left = mid + 1;
15             else if(midNum < rightNum)
16                 right = mid;
17             else {
18                 left++;
19                 right--;
20             }
21         }
22         return rotateArray[mid];
23     }
24 };