[알고리즘문제풀기] 배열 비교하기

문제

내가 작성한 정답

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

다른 사람들의 정답

import java.util.stream.IntStream;

class Solution {
    public int solution(int[] arr1, int[] arr2) {
        int answer = Integer.compare(arr1.length, arr2.length);

        if(answer == 0) {
            answer = Integer.compare(IntStream.of(arr1).sum(), IntStream.of(arr2).sum());
        }

        return answer;
    }
}