利用Java的二分法函数从一个数组中查找是否具有key元素。
Arrays.sort(a) //对a[]数组进行排序;
Arrays.binarySearch(a,number) //a是数组,number是key元素
import java.util.Arrays;
import java.util.Scanner;
public class Example4_11 {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int [] a = {12,34,9,23,45,6,45,90,123,19,34};
Arrays.sort(a);
System.out.println(Arrays.toString(a));
System.out.println("输入整数,程序判断该整数是否在数组中:");
int number = scanner.nextInt();
int index = Arrays.binarySearch(a,number);
if(index>=0)
System.out.println(number+"和数组中索引为"+index+"的元素值相同");
else
System.out.println(number+"不与数组中任何元素值相同");
}
}