题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
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;
int l = 0;
int r = nums.length;
while(l < r){
int mid = l + ((r - l) >> 1);
if(nums[mid] > target) r = mid;
else if(nums[mid] < target) l = mid + 1;
else {
return mid;
}
}
return -1;
}
}
#二分查找#
