(프로그래머스)(자바) 위장

코딩테스트 연습 - 해시 -위장

https://programmers.co.kr/learn/courses/30/lessons/42578

import java.util.*;

class Solution {
    public int solution(String[][] clothes) {
        int answer = 0;
        
        Map<String, List> hm = new HashMap<>();
        
        
        for(String[] cloth : clothes){
            if(hm.get(cloth[1]) == null){
                List<String> newList = new ArrayList();
                newList.add(cloth[0]);
                hm.put(cloth[1], newList);
            }else{
                List existList = hm.get(cloth[1]);
                existList.add(cloth[0]);
                hm.put(cloth[1], existList);  
            }
        }
        
        int count = 0;
        for(String key : hm.keySet()){
            List clothesList = (List)hm.get(key);
            //System.out.println(key+":"+clothesList.size());
            answer = answer == 0 ?  clothesList.size()+1:answer*(clothesList.size()+1) ;
        }
        
        return answer-1;
    }
}

코딩테스트 연습 -해시 - 위장