題目描述
把一個(gè)數(shù)組最開始的若干個(gè)元素搬到數(shù)組的末尾碗硬,我們稱之為數(shù)組的旋轉(zhuǎn)瘸彤。 輸入一個(gè)非遞減排序的數(shù)組的一個(gè)旋轉(zhuǎn)佩脊,輸出旋轉(zhuǎn)數(shù)組的最小元素验庙。 例如數(shù)組{3,4,5,1,2}為{1,2,3,4,5}的一個(gè)旋轉(zhuǎn)润梯,該數(shù)組的最小值為1过牙。 NOTE:給出的所有元素都大于0,若數(shù)組大小為0纺铭,請返回0寇钉。
import java.util.ArrayList;
public class Solution {
public int minNumberInRotateArray(int [] array) {
if(array.length == 0) {
return 0;
}
int i = 0;
for(; i < array.length - 2; i++) {
if(array[i] > array [i + 1]) {
break;
}
}
return array[i + 1];
}
public static void main(String [] args) {
int [] array = {6501,6828,6963,7036,7422,7674,8146,8468,8704,8717,9170,9359,9719,9895,9896,9913,9962,154,293,334,492,1323,1479,1539,1727,1870,1943,2383,2392,2996,3282,3812,3903,4465,4605,4665,4772,4828,5142,5437,5448,5668,5706,5725,6300,6335};
Solution obj = new Solution();
obj.minNumberInRotateArray(array);
}
}