class Solution {
    public int solution(int[] arr1, int[] arr2) {
        int answer = 0;
        return answer;
    }
}

해결법

방법 1

class Solution {
    public int solution(int[] arr1, int[] arr2) {
        int answer = 0;
        
        if (arr1.length != arr2.length) {
            if (arr1.length < arr2.length) {
                answer = -1;
            } else if (arr1.length > arr2.length) {
                answer = 1;
            } 
        } else {
            int sum1 = 0;
            
            for (int i = 0; i < arr1.length; i++) {
                sum1 += arr1[i];
            }
            
            int sum2 = 0;
            
            for (int j = 0; j < arr2.length; j++) {
                sum2 += arr2[j];
            }
            
            if (sum1 < sum2) {
                answer = -1;
            } else if (sum1 > sum2) {
                answer = 1;
            } 
        }
        
        return answer;
    }
}

배열 비교하기 Lv. 0