JZ6 旋转数组的最小数字

这道题和LeetCode 154一样。

import java.util.ArrayList;
public class Solution {public int minNumberInRotateArray(int [] array) {// Corner Caseif(array.length == 0){return 0;}int left = 0, right = array.length - 1;if(array[left] < array[right]){return array[left];}while(left < right){int mid = left + (right - left) / 2;if(array[mid] < array[right]){right = mid;}else if(array[mid] > array[right]){left = mid + 1;}else{right--;}}return array[left];}
}