class Solution {
public int search(int[] nums, int target) {
if(nums.length==0)
return -1;
int mid,left=0,right=nums.length-1;
if(target<nums[left]||target>nums[right]||left>right){
return -1;
}
while(left<=right){
mid=(left+right)/2;
if(target<nums[mid]){
right=mid-1;
}else if(target>nums[mid]){
left=mid+1;
}else{
return mid;
}
}
return -1;
}
}
java leetcode二分查找
最新推荐文章于 2023-11-13 11:11:16 发布