[자바(JAVA)] 나누어 떨어지는 숫자 배열

 

 

✅ 내 풀이

import java.util.Arrays;

class Solution {
    public int[] solution(int[] arr, int divisor) {
        int[] answer = new int[arr.length];
        int index = 0;
        
        for(int i=0; i<arr.length; i++) {
            if(arr[i] % divisor == 0) {
                answer[index] = arr[i];
                index++;
            }
        }
        if(index == 0) {
            return new int[] {-1};
        }else {
            answer = Arrays.copyOf(answer, index);
            Arrays.sort(answer);
        }
        
        return answer;
    }
}