배열 비교하기

 

 

 

 

class Solution {
    public int solution(int[] arr1, int[] arr2) {
        // arr1이 크면 1, arr2가 크면 -1 , 같다면 0 
        int arr1_length = arr1.length; 
        int arr2_length = arr2.length;
        
        if(arr1_length == arr2_length){
            int arr1_sum =0;
            int arr2_sum =0;
            for(int i=0; i<arr1_length; i++){
                arr1_sum += arr1[i];
            }
            for(int i=0; i<arr2_length; i++){
                arr2_sum += arr2[i];
            }
            if(arr1_sum == arr2_sum){
                return 0;
            }
            return arr1_sum > arr2_sum ? 1 : -1;
        }else {
            return arr1_length > arr2_length ? 1 : -1;
        }
        
    }
}