class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length-1;
while(left<=right){
int mid = left+((right-left)>>1);
if(nums[mid]==target) return mid;
if(nums[mid] < target) left = mid + 1;
else right = mid - 1;
}
return -1;
}
}
java二分搜索模板
最新推荐文章于 2024-06-04 11:36:14 发布