Beakjoon&프로그래머스/Java
[프로그래머스/Java] 배열 비교하기
현장
2025. 2. 6. 17:50
-Code
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;
} else {
int arr1_max = Arrays.stream(arr1).sum();
int arr2_max = Arrays.stream(arr2).sum();
return arr1_max == arr2_max ? 0 : (arr1_max > arr2_max ? 1 : -1);
}
}
}