剑指 Offer 11. 旋转数组的最小数字

class Solution {
public:
    int minArray(vector& numbers) {
        int len=numbers.size();
        return division(0,len-1,numbers);

    }
    int division(int l,int r,vector &numbers)
    {
        if(l>=r)
        return numbers[l];
        int target=numbers[r];
        int mid=(l+r)>>1;
        if(target==numbers[mid])
        {
            return min(division(mid+1,r,numbers),division(l,mid,numbers));
        }
        if(target