class solution{

}

class solution{

public:

int minNumberInRotateArray(vector<int> rotateArray){

if(rotateArray.size()==0)

return 0;

int head=0,tail=rotateArray.size()-1,mid=(head+tail)/2;

//没有旋转的情况，或者说旋转后和原数组一样的情况

if(rotateArray[head]<rotateArray[tail])

return rotateArray[head];

while(rotateArray[head]>=rotateArray[tail]){

if(tail-head==1){

mid=tail;

break;

}

if(rotateArray[mid]>=rotateArray[head])

head=mid;

else if(rotateArray[mid]<rotateArray[tail])

tail=mid;

mid=(head+tail)/2;

}

return rotateArray[mid];

}

}