[JAVA] 프로그래머스 - 배열 비교하기

https://school.programmers.co.kr/learn/courses/30/lessons/181856

프로그래머스

 

 

 

 

 

정답 

 

class Solution {
    
    public int Sum(int arr[]) {
        
        int result =0;
        for(int i=0; i<arr.length; i++)
        {
            result +=arr[i];
        }
        
        return result;
    }
    
    public int solution(int[] arr1, int[] arr2) {

        int len1 = arr1.length;
        int len2 = arr2.length;
        int answer = 0;
        
        if(len1!=len2)
        {
            answer = (len1>len2)?1:-1;
        }
        else
        {
            int sum1 = Sum(arr1);
            int sum2 = Sum(arr2);
            
            if(sum1==sum2)
            {
                return 0;
            }
            else
            {
                answer = (sum1>sum2)?1:-1;
            }
            
        }
        return answer;
    }
}

 

 

 

다른 사람의 풀이 

 

class Solution {
    public int solution(int[] arr1, int[] arr2) {
        if (arr1.length < arr2.length) return -1;
        else if (arr1.length > arr2.length) return 1;
        int arr1Sum = 0, arr2Sum = 0;
        for (int i = 0;i < arr1.length;i++) {
            arr1Sum += arr1[i];
            arr2Sum += arr2[i];
        }
        return arr1Sum == arr2Sum ? 0 : (arr1Sum > arr2Sum ? 1 : -1);
    }
}