이아손의 아르고호

import java.util.*; class Solution { public String solution(String[] participant, String[] completion) { String fail = ""; HashMap answer = new HashMap(); int value = 0; for(int i = 0; i< participant.length; i++){ if(answer.containsKey(participant[i])){ value = answer.get(participant[i]); answer.put(participant[i], value + 1); }else{ answer.put(participant[i], 1 ); } } for(int i = 0; i < complet..