class Solution {
public int findMin(int[] nums) {
//利用2分查找分析情况即可得出
int low = 0;
int hight = nums.length - 1;
while(low < hight) {
int pivot = (low + hight) /2;
if(nums[pivot] < nums[hight]) {
hight = pivot;
}else {
low = pivot + 1;
}
}
return nums[low];
}
}
算法通关村——二分查找的应用
最新推荐文章于 2024-07-25 23:26:35 发布