剑指offer---旋转数组的最小数字

1 class Solution {
2 public:
3     int minNumberInRotateArray(vector<int> rotateArray) {
4         
5     }
6 };

 1 class Solution {
 2 public:
 3     int minNumberInRotateArray(vector<int> rotateArray) {
 4         if(rotateArray.size() == 0)
 5             return 0;
 6         int left = 0;
 7         int right = rotateArray.size()-1;
 8         int pMid = (left + right) / 2;
 9         if(rotateArray[left] < rotateArray[right])
10             return rotateArray[0];
11         else{
12             while(right-left != 1){
13                 if(rotateArray[left] == rotateArray[right] && rotateArray[left] == rotateArray[pMid])
14                     return MinInOrder(rotateArray, left, right);
15                 else{
16                     if(rotateArray[pMid] >= rotateArray[left]){
17                         left = pMid;
18                     }
19                     else{
20                         right = pMid;
21                     }
22                     pMid = (left + right) / 2;
23                 }
24             }
25             return rotateArray[right];
26         }
27     }
28 
29 private:
30     int MinInOrder(vector<int> array, int left, int right){
31         int res = array[left];
32         for(int i=left+1; i<=right; i++){
33             if(array[i] < res)
34                 res = array[i];
35         }
36         return res;
37     }
38 };