class Solution {
public int search(int[] nums, int target) {
int right=nums.length-1;
int left=0;
while(left<=right){
int mid=(left+right)/2;
if(target==nums[mid])
return mid;
if(target<nums[mid]){
right=mid-1;
}
if(target>nums[mid]){
left=mid+1;
}
}
return -1;
}
}```
注意,java使用二分法mid赋值时需要加一或减一,避免重复检测
704. 二分查找
最新推荐文章于 2024-05-18 16:42:38 发布