java类方法的使用

package HelloWrold;
import  java.util.Arrays;
import  java.util.Scanner;
public class Monkey {
    public static void main(String[] args){
        int[] a={1,2,5,7,3,2,98};//整数排序
        Arrays.sort(a);
        for(int x:a){
            System.out.print(x+" ");
        }

        System.out.println();

        String[] a1={"3","8","1"};//字符串排序
        System.out.print(Arrays.toString(a1)+" ");
        Arrays.sort(a1);
        System.out.print(Arrays.toString(a1)+"\n");

        int[] a2={1,2,3,4};
        int[] a3={1,2,4,4};
        System.out.print("这两个数组："+Arrays.equals(a2,a3)+"\n");//判断两个数组是否相等

        int[] a4={1,3,2,4,3,4};
        Arrays.fill(a4,520);
        System.out.print(Arrays.toString(a4)+"\n");//将数组中的值改为你想要的值

        int[] a5={1,234,54,23,233,235};
        Arrays.sort(a5);
        for(int c:a5){
            System.out.print(c+"  ");
        }
        System.out.print("索引位为："+Arrays.binarySearch(a5,234)+"   ");//判断当前值的索引位置，其原理是先进行数组的排序然后进行判断
        System.out.print("索引位为："+Arrays.binarySearch(a5,0)+"   ");//搜索元素不是数学组元素，且小于数组中的最小值
        System.out.print("索引位为："+Arrays.binarySearch(a5,54)+"\n");

        System.out.print("请输入:");
        Scanner s=new Scanner(System.in);
        int nb=s.nextInt();

    }
}