프로그래머스 나누어떨어지는숫자배열

import java.util.ArrayList;
import java.util.Arrays;

class Solution {
    public static void main(String[] args) {
        int[] arr = {5,9,7,10};
        int divisor= 5;
        System.out.println(Arrays.toString(solution(arr,divisor)));
    }
    public static int[] solution(int[] arr, int divisor) {
        int[] a = new int[]{};
        a = new int[]{-1};
        ArrayList<Integer> resultList = new ArrayList<>();
        for(int i =0; i< arr.length; i++){
            if (arr[i]%divisor ==0){
                resultList.add(arr[i]);
            }
        }
        if(resultList.size() == 0 ){
            return a;
        }
        int[] answer = new int[resultList.size()];
        for(int i =0; i<resultList.size(); i++){
            answer[i] = resultList.get(i);
        }
        Arrays.sort(answer);
        return answer;
    }
}