题解 | #二分查找-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 int i = 0; int j = nums.length - 1; while (i <= j) { int m = (i + j) >>> 1; if (target < nums[m]) { j = m - 1; } else if (nums[m] < target) { i = m + 1; } else { return m; } } return -1; } }