算法1
二分法
Java 代码
class Solution {
public int findMin(int[] nums) {
int length = nums.length;
if(nums[0] < nums[length - 1]) return nums[0];
else{
int l = 0;
int r = length - 1;
while(l < r){
int mid = (l + r) / 2;
if(nums[mid] >= nums[0]) l = mid + 1;
else r = mid;
}
return nums[l];
}
}
}