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

import java.util.Arrays;
class Solution {
    public int[] solution(int[] arr) {
        int[] answer;
        int min = arr[0];
         int j=0;
        if(arr.length==1){
            answer = new int[1];
            answer[0]=-1;
        }else{
             answer = new int[arr.length-1];
            for(int i=0; i<arr.length; i++){
                if(min>arr[i])
                    min = arr[i];
            }
            
              for(int i=0; i<arr.length; i++){
                
                if(arr[i]==min){
                    continue;
                }
                  else{
                      answer[j] = arr[i];
                      j++;
                  }
                      
            }

        }
        
        return answer;
    }
}