본문 바로가기
Algorithm/Programmers

[Programmers] Lv.0 / 배열 비교하기 / Java

by unknownomad 2024. 2. 15.

문제

 

풀이

import java.util.*;

class Solution {
    public int solution(int[] arr1, int[] arr2) {
        if (arr1.length != arr2.length) {
            return Integer.compare(arr1.length, arr2.length);
        } else {
            int arr1Sum = sumArray(arr1);
            int arr2Sum = sumArray(arr2);
            return Integer.compare(arr1Sum, arr2Sum);
        }
    }
    
    private int sumArray(int[] arr) {
        return Arrays.stream(arr).sum();
    }
}

 

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;
    }
}

 

출처

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

댓글