[프로그래머스/Java] Lv.0 배열 비교하기

문제

 

 

728x90

---

풀이

 

 

 

import java.util.Arrays;
 
class Solution {
    public int solution(int[] arr1, int[] arr2) {
        if (arr1.length != arr2.length) {
            return arr1.length > arr2.length ? 1 : -1;
        }
        
        int arr1_sum = Arrays.stream(arr1).sum();
        int arr2_sum = Arrays.stream(arr2).sum();
 
        return arr1_sum >= arr2_sum ? arr1_sum == arr2_sum ? 0 : 1 : -1;
 
    }
}

 

---

반응형