[Programmers] 12910. 나누어 떨어지는 숫자 배열

import java.util.*;
class Divisible {
    public int[] divisible(int[] arr, int divisor) {
        int cnt = 0;
        int num = 0;
        
        for(int i = 0; i < arr.length; i++) {
            if(arr[i] % divisor == 0) {
                cnt++;
            }
        }
        
        if(cnt == 0) {
            int[] answer = {-1};
            return answer;
        }
        
        int[] answer = new int[cnt];
        
        for(int i = 0; i < arr.length; i++) {
            if(arr[i] % divisor == 0) {
                answer[num] = arr[i];
                num++;
            }
        }
        Arrays.sort(answer);
        return answer;
    }
}