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