题解 | 二分查找-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) { if (nums.length == 0) return -1; int startIndex = 0, endIndex = nums.length - 1; while (startIndex <= endIndex) { int middle = (startIndex + endIndex) / 2; if (nums[middle] == target) { return middle; } if (nums[middle] > target) { endIndex = middle - 1; } else { startIndex = middle + 1; } } return -1; } }#二分查找#