找出数组里能被2整除的数，并存到一个新数组里，在用return将它返回

import java.util.Arrays;

public class Test {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5};
        //int arr [] = {1,  3,  5};
        int[] z = arrEven(arr);
        System.out.println(Arrays.toString(z));
    }

    public static int[] arrEven(int[] arr) {
        int evenCount = 0;
        for (int i : arr) {
            if (i % 2 == 0) {
                evenCount++;
            }
        }
        if (evenCount == 0) {
            return null;
        } else {
            int[] a = new int[evenCount];
            int j = 0;
            for (int i = 0; i < arr.length; i++) {
                if (arr[i] % 2 == 0) {
                    a[j] = arr[i];
                    j++;
                }
            }
            return a;
        }
    }
}

输出结果:

[2, 4]