class Solution {
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length-1;
while(left <= right){
int mid = (right - left) / 2 + left;
int num = nums[mid];
if(num == target){
return mid;
}else if(num > target){
right = mid - 1;
}else{
left = mid + 1;
}}
return -1;
}
}
数组-二分查找
最新推荐文章于 2024-07-14 12:25:25 发布