[Programmers] Lv1: 나누어 떨어지는 숫자 배열(12910)

문제

- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12910

 

풀이

import java.util.*;

class Solution {
    public int[] solution(int[] arr, int divisor) {
        ArrayList<Integer> answer = new ArrayList<>();
        for (int i = 0; i < arr.length; ++i) {
            if (arr[i] % divisor == 0) {
                answer.add(arr[i]);
            }
        }
        
        answer.sort((o1, o2) -> Integer.compare(o1, o2));
        
        if (answer.size() == 0) {
            return new int[]{-1};
        } else {
            return answer.stream().mapToInt(Integer::intValue).toArray();    
        }
    }
}