题解 | #二分查找-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) {
int length = nums.length ;
if (length <= 0) {
return -1;
}
int index = 0;
int half = 0;
while (length >= 0) {
half += (length - index) / 2;
if(half >= length){
return -1;
}
if (nums[half] > target) {
length = half;
half = 0;
} else if (nums[half] < target) {
if(index == half)return -1;
index = half;
} else if (nums[half] == target){
return half;
}
}
return index;
}
}
查看5道真题和解析

