1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

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