给定一个 n 个元素有序的(升序)整型数组 nums 和一个目标值 target ,写一个函数搜索 nums 中的 target,如果目标值存在返回下标,否则返回 -1。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/binary-search
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
public class BinSearch { public static void main(String[] args) { int[] ints = {2, 5}; int search = search2(ints, 5); System.out.println("search = " + search); } public static int search(int[] nums, int target) { int left = 0; int right = nums.length - 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; } public static int search2(int[] nums, int target) { if (nums.length == 1) return nums[0] == target ? 0 : -1; int left = 0; int right = nums.length; while (left < right) { int mid = (left + right) / 2; if (nums[mid] > target) { right = mid; } else if (nums[mid] < target) { left = mid + 1; } else { return mid; } } return -1; } }