private int binarySearch(int[] nums,int key) {
int left = 0;
int right = nums.length - 1;
int mid;
while(left <= right){
mid = (left + right)/2;
if(nums[mid] < key){
left = mid + 1;
}else if(nums[mid] > key){
right = mid - 1;
}else{
return mid;
}
}
return -1;
}
时间复杂度:O(logn)
二分查找
最新推荐文章于 2023-05-28 13:59:52 发布