Java实现-合并数组、逆序输出数组、求数组中素数

代码实现

public class iii { //iii为类名，可修改
    public static void main(String[] args) {
        int[] arr1={4,3,6};
        int[] arr2={4,0,-2,2,8};
        int[] arr=new int[arr1.length + arr2.length];

        System.out.println("合并后：");
        comArr(arr1,arr2,arr);
        System.out.println("逆序:");
        backordArr(arr);
        System.out.println("求素数");
        primeNum(arr);
    }
    //合并arr1与arr2
    private static void comArr(int[] arr1, int[] arr2,int[] arr) {
        for (int i = 0; i < arr1.length; i++) {
            arr[i]=arr1[i];//arr1的值赋值给arr
        }
        for (int j = 0; j < arr2.length; j++) {
            arr[arr1.length+j]=arr2[j];//arr2的值赋值给arr,但是此时的长度应是arr1.length+j（因为要接在arr1的后面）
        }
        for (int x = 0; x < arr.length; x++) {
            System.out.print(arr[x]+" ");
        }
        System.out.println();
    }

    //逆序
    private static void backordArr(int[] arr) {
        for (int i = arr.length-1; i >=0 ; i--) {
            System.out.print(arr[i]+" ");
        }
        System.out.println();
    }

    //素数个数
    private static void primeNum(int[] comArr) {
        int sum=0;
        for (int i = 0; i < comArr.length; i++) {
            if(comArr[i] > 1 && comArr[i] == 2){
                sum++;
                System.out.println("素数为：" + comArr[i]);
            }
            else if(comArr[i] > 1 && comArr[i] % 2 != 0){
                sum++;
                System.out.println("素数为：" + comArr[i]);
            }
        }
        System.out.println("素数个数："+sum);
    }
}

运行结果