Java 如何将用户输入添加到此代码并使用递归算法进行搜索？

我想从用户那里获取输入并搜索索引

有人能帮我做吗？我们将不胜感激。多谢各位

public class Main {

    int[] array = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30};

    public int binarySearch(int key, int l, int r) {
        if (r < l) {
            return -1;
        }
        int mid = (l + r) / 2;
        if (key == array[mid]) {
            return mid;
        }
        if (key < array[mid]) {
            return binarySearch(key, l, mid - 1);
        } else {
            return binarySearch(key, mid + 1, r);
        }

    }

    public static void main(String[] args) {
        Main b = new Main();

        for (int i = 2; i < 32; i += 2) {

            System.out.println("Search for element " + i);
            System.out.println("This element is found at " + b.binarySearch(i, 0, 14));
            System.out.println("=======+============+=======+==============");
        }
    }
}

公共类主{
int[]数组={2,4,6,8,10,12,14,16,18,20,22,24,26,28,30}；
公共整数二进制搜索（整数键、整数l、整数r）{
if（r

您可以使用

然后将此输入传递给您的

binarySearch（）

方法

import java.util.Scanner；
import java.util.Scanner;


public class Main {
    int[] array = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30};

    public int binarySearch(int key, int l, int r) {
        if (r < l) {
            return -1;
        }
        int mid = (l + r) / 2;
        if (key == array[mid]) {
            return mid;
        }
        if (key < array[mid]) {
            return binarySearch(key, l, mid - 1);
        } else {
            return binarySearch(key, mid + 1, r);
        }

    }

    public static void main(String[] args) {
        Main b = new Main();
        System.out.println("input the element you want to search :");
        Scanner in = new Scanner(System.in);
        int i = in.nextInt();
        System.out.println("Search for element " + i);
        System.out.println("This element is found at " + b.binarySearch(i, 0, 14));
        System.out.println("=======+============+=======+==============");
        in.close();
    }
}

公共班机{
int[]数组={2,4,6,8,10,12,14,16,18,20,22,24,26,28,30}；
公共整数二进制搜索（整数键、整数l、整数r）{
if（r

您好，谢谢您的回答。您能告诉我一种方法，如果不将这些数字作为数组，我无法从用户那里获取这些数字吗

import java.util.Scanner;


public class Main {
    int[] array = {2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30};

    public int binarySearch(int key, int l, int r) {
        if (r < l) {
            return -1;
        }
        int mid = (l + r) / 2;
        if (key == array[mid]) {
            return mid;
        }
        if (key < array[mid]) {
            return binarySearch(key, l, mid - 1);
        } else {
            return binarySearch(key, mid + 1, r);
        }

    }

    public static void main(String[] args) {
        Main b = new Main();
        System.out.println("input the element you want to search :");
        Scanner in = new Scanner(System.in);
        int i = in.nextInt();
        System.out.println("Search for element " + i);
        System.out.println("This element is found at " + b.binarySearch(i, 0, 14));
        System.out.println("=======+============+=======+==============");
        in.close();
    }
}