【Java】实现二分法

引言：最近现场面试笔试手写算法，二分法如下：

public class BinarySearch {
    public static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;

        while (left <= right) {
            int mid = (left + right) / 2;

            if (arr[mid] == target) {
                return mid;
            } else if (arr[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return -1; // 如果未找到目标值，返回 -1
    }

    public static void main(String[] args) {
        int[] arr = {1, 3, 5, 7, 9};
        int target = 5;

        int index = binarySearch(arr, target);

        if (index != -1) {
            System.out.println("目标值 " + target + " 在数组中的索引为 " + index);
        } else {
            System.out.println("目标值 " + target + " 未找到");
        }
    }
}