[Level 1] 제일 작은 수 제거하기

import java.util.*;

class Solution {
    public int[] solution(int[] arr) {
        if(arr.length==1) {
            int[] answer = new int[1];
            answer[0] = -1;
            return answer;
        }
        
        int[] answer = new int[arr.length-1];
        int min = Integer.MAX_VALUE;
        List<Integer> list = new ArrayList<>();
        
        for(int i=0; i<arr.length; i++) { min = Math.min(min, arr[i]); }
        for(int i=0; i<arr.length; i++) {
            if(arr[i]==min) { continue; }
            list.add(arr[i]);
        }
        
        for(int i=0; i<answer.length; i++) { answer[i] = list.get(i); }
        
        return answer;
    }
}