题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
import java.util.*; public class Solution { public int search (int[] nums, int target) { int cnt = nums.length; if (cnt == 0) return -1; int left = 0; int right = cnt -1; while (left <= right) { int mid = (left + right) / 2; if (nums[mid]>target) right = mid - 1; else if (nums[mid]<target) left = mid + 1; else return mid; } return -1; } }