一、题目
![面试必刷TOP101:17、二分查找-I_一维数组](//dev-img.mos.moduyun.com/20231102/2eb4b761-ef18-410d-bab9-0fc94b1ec621.png)
![面试必刷TOP101:17、二分查找-I_java_02](//dev-img.mos.moduyun.com/20231102/8093b119-2ad5-41e9-a3d5-291468944ff9.png)
二、题解
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
*
* @param nums int整型一维数组
* @param target int整型
* @return int整型
*/
public int search (int[] nums, int target) {
// write code here
if(nums.length == 0) return -1;
if(nums.length == 1) return target == nums[0] ? 0:-1;
int i = 0;
int j = nums.length-1;
while(i <= j){
int middle = (i + j)/2;
if(target == nums[middle]){
return middle;
}else if(target < nums[middle]){
j = middle-1;
}else{
i = middle+1;
}
}
return -1;
}
}