[프로그래머스/자바] 배열 비교하기

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