C# 나누어 떨어지는 숫자 배열

public class Solution {
    public int[] solution(int[] arr, int divisor) {
        int[] answer = new int[arr.Length];
        int curIndex = 0;
        for(int i = 0 ; i < arr.Length ; i++)
        {
            if(arr[i] % divisor == 0)
                answer[curIndex++] = arr[i];
        }
        answer = answer.Where(val => val != 0).ToArray();
          
        if (answer.Length == 0)
        {
            answer = new int[1];
            answer[0] = -1;
        }
        Array.Sort(answer);
 
        return answer;
    }
}