Java实现二分查找

import java.util.Scanner;

/**
 * @author Trank
 * @projectName Lecode
 */
public class BinarySearch {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        //数组长度
        int num1 = sc.nextInt();
        //需要查找的值
        int k = sc.nextInt();
        //数组中的值
        int[] arr = new int[num1];
        for (int i = 0; i < num1; i++) {
            if (sc.hasNext()){
                arr[i] = sc.nextInt();//将值存入数组
            }
        }
        //二分法查找
        int left = 0;
        int right = arr.length-1;
        int mid = 0;
        while (left <= right){
            mid = (right + left)/2;
            if (arr[mid] < k){
                left = mid + 1;
            }else {
                right = mid -1;
            }
        }
        System.out.println(left);
    }
}