[프로그래머스] 제일 작은 수 제거하기

import java.util.*;
class Solution {
    public int[] solution(int[] arr) {
        ArrayList<Integer> list = new ArrayList<>();
        int[] copyArr = Arrays.copyOf(arr, arr.length);
        Arrays.sort(copyArr);
        int min = copyArr[0];
        
        if(arr.length == 1 && arr[0] == 10 ){
            return new int[] {-1};
        }
        
        for(int i=0; i<arr.length; i++){
            if(arr[i] != min){
                list.add(arr[i]);
            }
        }
        
        int[] answer = new int [list.size()];
        
        for(int i=0; i<list.size(); i++){
            answer[i] = list.get(i);
        }
        
        return answer;
    }
}