프로그래머스 Lv.0 배열 비교하기

 

<Solution>

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