불량사용자

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

코딩테스트 연습 - 불량 사용자

 

문제 코드 풀이

#include <string>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>


using namespace std;

set <string> s;
bool visited[8];

bool matched(string user, string ban){
    
    if(user.length()!=ban.length()) return false;
    else{
        for(int i=0; i<user.length(); i++){
            if(ban[i]=='*' || ban[i]==user[i]) continue;
            else return false;
        }
        return true;
    }
    
}

void dfs(int n, vector<int> check, vector<string> user, vector<string> ban){
    
    if(n==ban.size()){
        sort(check.begin(), check.end());
        string in;
        for(int i=0; i<check.size() ;i++) in+=to_string(check[i]);
        s.insert(in);
        return;
    }
    
    for(int i=0; i<user.size(); i++){
        if(matched(user[i],ban[n])&&!visited[i]){
            check.push_back(i);
            visited[i]=true;
            dfs(n+1, check, user, ban);
            visited[i]=false;
            check.pop_back();
        }
    }
    
}

int solution(vector<string> user_id, vector<string> banned_id) {
    
    for(int i=0; i<8; i++) visited[i]=false;
    
    int answer = 0;
    vector <int> check;
    dfs(0, check, user_id, banned_id);

    answer = s.size();
    return answer;
}