class Solution {
public:
int minNumberInRotateArray(vector<int> rotateArray) {
int size = rotateArray.size();
if(size == 0){
return 0;
}
if(size == 1){
return rotateArray[0];
}
int i = 1;
while(i < size){
if(rotateArray[i] < rotateArray[i-1]){
return rotateArray[i];
}
i++;
}
return rotateArray[size];
}
};
剑指offer——旋转数组最小数字
猜你喜欢
转载自blog.csdn.net/qwer7512090/article/details/104976929
今日推荐
周排行