배열 비교하기

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

• 문제 풀이

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

public class Solution {
    public int solution(int[] arr1, int[] arr2) {
        int sum1 = 0, sum2 = 0;

        for (int i : arr1) {
            sum1 += i;
        }

        for (int i : arr2) {
            sum2 += i;
        }

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