题目:把一个数组最开始的若干个元素搬到数组的尾部,我们称之为数组的旋转,输入一个递增排序的数组的旋转,输出旋转数组的最小元素
思路:直接扫一遍O(n)
利用二分搜索的思想O(logn)->这种搜索对特例要特殊处理
public class GetMin {
public static void main(String[] args) {
int[]a ={1,0,1,1,1};
System.out.println(getMin(a));
int[] b = {2,3,4,5,6,7,7};
System.out.println(getMin(b));
}
public static int getMin(int[] source){
if(source==null || source.length==0)
throw new RuntimeException("terriable input");
int start = 0;
int end = source.length-1;
int ans = source[start];
while(source[start]>=source[end]){
if(start+1==end){
ans = source[end];
break;
}
int mid = (start+end)/2;
if(source[start]==source[mid] && source[start]==source[mid]){
for(int i=start;i<=end;i++){
if(source[i]