题目描述:一个递增排序的数组,把数组中最开始的若干个元素放到数组的末尾,称之为数组的旋转,输出旋转数组的最小元素。比如,1,2,3,4,5翻转后4,5,1,2,3。找出旋转数组中最小的数字
题目解析:
public static int getMinNum(int[] numbers) {
if (numbers == null || numbers.length < 1) {
throw new RuntimeException("wrong");
}
int start = 0;
int end = numbers.length - 1;
int middle = 0;
while (numbers[start] >= numbers[end]) {
if (end - start == 1) {
return numbers[end];
}
middle = (start + end) / 2;
if(numbers[middle]>=numbers[start]){
start = middle;
}else{
end = middle;
}
}
return numbers[middle];
}