java在一个类中写方法比较两个int形数组大小

长度不相等则补零，对应位置元素大的个数多的数组大
输入
2／/数组长度
1 2
3
2 1 -1
输出
ture／／数组1比数组2大的元素多

public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int countMax1 = 0;
        int countMax2 = 0;
        int arrSize1 = s.nextInt();
        int[] arr1 = new int[arrSize1];
        for (int i = 0; i < arrSize1; i++) {
            arr1[i] = s.nextInt();
        }
        int arrSize2 = s.nextInt();
        int[] arr2 = new int[arrSize2];
        for (int i = 0; i < arrSize2; i++) {
            arr2[i] = s.nextInt();
        }
        int loopSize = Math.max(arrSize1, arrSize2);
        for (int i = 0; i < loopSize; i++) {
            int arrItem1 = 0;
            int arrItem2 = 0;
            if (i < arrSize1) {
                arrItem1 = arr1[i];
            }
            if (i < arrSize2) {
                arrItem2 = arr2[i];
            }
            if (arrItem1 > arrItem2) {
                countMax1++;
            }
            if (arrItem2 > arrItem1) {
                countMax2++;
            }
        }

        System.out.println(countMax1 > countMax2);
    }

 public static boolean compareArr(int[] arr1, int[] arr2){
        if (arr1 == null || arr2 == null){
            throw new RuntimeException();
        }
        int length = Math.max(arr1.length,arr2.length);
        int result = 0;

        for (int i = 0; i < length; i++) {
            int t1 = i >= arr1.length ? 0 : arr1[i];
            int t2 = i >= arr2.length ? 0 : arr2[i];

            result = (t1 >= t2) ? result + 1 : result -1;
        }
        return result >= 0;
    }