프로그래머스(1) - 나누어 떨어지는 숫자 배열 [JAVA]

 

 

 

 

 

 

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