🐣 문제

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

🐥 코드

#include <string>
#include <vector>
#include <unordered_map>

using namespace std;

int solution(vector<vector<string>> clothes) {
    int answer = 1;
    unordered_map <string, int> hash;
    
    int N = clothes.size();
    for(int i = 0; i < N; i++){
        hash[clothes[i][1]]++;
    }
     
    for(auto i : hash){
       answer *= (i.second + 1);
    }

    return answer - 1;
}