java实现二分查找

上代码:

public class BinarySearch {
    public static int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length - 1; // 定义了target在左闭右闭的区间内，[left, right]
        while (left <= right) { // 当left == right时，区间[left, right]仍然有效
            int middle = left + (right - left) / 2; // 等同于 (left + right) / 2，防止溢出
            if (nums[middle] > target) {
                right = middle - 1; // target在左区间，所以[left, middle - 1]
            } else if (nums[middle] < target) {
                left = middle + 1; // target在右区间，所以[middle + 1, right]
            } else { // 既不在左边，也不在右边，那就是找到答案了
                return middle;
            }
        }
        // 没有找到目标值
        return -1;
    }

    public static void main(String[] args) {
        int[] nums = {1, 3, 5, 7, 9, 11, 13};
        int target = 7;
        int resultIndex = search(nums, target);
        if (resultIndex != -1) {
            System.out.println("Target found at index: " + resultIndex);
        } else {
            System.out.println("Target not found in the array.");
        }
    }
}