题目描述
把一个数组最开始的若干个元素搬到数组的末尾,我们称之为数组的旋转。输入一个递增排序的数组的一个旋转,输出旋转数组的最小元素。例如数组{3,4,5,1,2}为{1,2,3,4,5}的一个旋转,该数组的最小值为1。
- import java.util.ArrayList;
- public class Solution {
- public int minNumberInRotateArray(int [] array) {
- if(array.length==0) return 0;
- int start = 0;
- int end = array.length-1;
- int mid = (start+end)/2;
- int min = 1<<100;
- while(start<end){
- if(array[mid]>array[end]){
- start = mid+1;
- mid = (start+end)/2;
- }else if(array[mid]<array[end]){
- end = mid;
- mid = (start+end)/2;
- }else{
- for(int i=start;i<=end;i++){
- if(array[i]<min) min = array[i];
- }
- return min;
- }
- }
- return array[start];
- }
- }
原文链接 http://blog.csdn.net/crazy__chen/article/details/44986465