java数组的有关算法以及Arrays工具类

package wzy;

import java.util.Arrays;

public class day04 {
    public static void main(String[] args) {
        String[] arr = new String[]{"JJ", "GG", "DD", "MM", "BB", "SS"};
        //对数组的复制
        String[] arr1 = new String[arr.length];
        for (int i = 0; i < arr.length; i++) {
            arr1[i] = arr[i];
        }
        //对数组的反转方法1
        for (int i = 0; i < arr.length / 2; i++) {
            String temp = arr[i];
            arr[i] = arr[arr.length - i - 1];
            arr[arr.length - i - 1] = temp;
        }
        //方法2
        for (int i = 0, j = arr.length - 1; i < j; i++, j--) {
            String temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
        //查找（线性查找）
        String dest = "BB";
        boolean isFlag = true;
        for (int i = 0; i < arr.length; i++) {
            if (dest.equals(arr[i])) {//equals比较内容
                isFlag = false;
                System.out.println("找到了，位置在：" + i);
            }
        }
        if (isFlag) {
            System.out.println("很抱歉，没有找到。");
        }
        //查找（二分法查找）
        int[] arr2 = new int[]{3,4,5,2,4,7,2,98,43};
        Arrays.sort(arr2);//对数组进行升序排列
        int dest1 = 98;
        int head = 0;
        int end = arr2.length-1;
        boolean isFlag1 = true;
        while (head <= end){
            int middle = (head + end)/2;
            if (dest1 == arr2[middle]){
                System.out.println("找到了"+ middle);
                isFlag1 = false;
                break;
            }else if (arr2[middle]>dest1){
                end = middle - 1;
            }else {
                head = middle +1;
            }
        }
        if (isFlag1){
            System.out.println("很遗憾没有找到");
        }
        //冒泡排序
        int[] arr3 = new int[]{4,6,15,278,2,8,4,33,68};
        for (int i = 0; i <arr3.length-1 ; i++) {
            for (int j = 0; j <arr3.length-1-i ; j++) {
                if (arr3[j]>arr3[j+1]){
                    int temp = arr3[j];
                    arr3[j] = arr3[j+1];
                    arr3[j+1] = temp;
                }
            }
        }
        for (int i = 0; i <arr3.length ; i++) {
            System.out.print(arr3[i]+"\t");
        }
        //Arrays工具类的使用

        //boolean equals(int[] a,int[] b):判断两个数组是否相等
        int[] arr5 = new int[]{1,2,3,4};
        int[] arr6 = new int[]{1,2,3,4};
        boolean isEquals = Arrays.equals(arr5,arr6);
        System.out.println(isEquals);
        //String toString(int[] a):输出数组信息
        System.out.println(Arrays.toString(arr2));
        //void fill(int[] a,int val):将指定值填充到数组之中
        Arrays.fill(arr5,10);
        System.out.println(Arrays.toString(arr5));
        //void sort(int[] a):对数组进行升序排序
        Arrays.sort(arr3);
        System.out.println(Arrays.toString(arr3));
        //int binarySearch(int[] a,int key):二分查找后输出位置
        int index = Arrays.binarySearch(arr5,4);
        System.out.println(index);//如果返回的值为负数，则未找到

    }
}