[プログラマー]不良ユーザー

に答える

コード#コード#

def match(uid, bid):
    if len(uid) != len(bid): return False
    for v1, v2 in zip(uid, bid):
        if v2 == '*': continue
        if v1 != v2: return False
    return True

# 두 리스트 크기 같아야 됨
def match_list(uid_list, bid_list):
    if not uid_list and not bid_list:
        return True
    for i in range(len(uid_list)):
        for j in range(len(bid_list)):
            if match(uid_list[i], bid_list[j]):
                if match_list(uid_list[:i] + uid_list[i+1:], bid_list[:j] + bid_list[j+1:]):
                    return True
    return False

def solution(user_id, banned_id):
    answer = 0
    N = len(user_id)
    M = len(banned_id)
    for i in range(1, 1 << N):
        if bin(i)[2:].count('1') != M: continue
        uid_list = []
        for j in range(N):
            if i & (1 << j):
                uid_list.append(user_id[j])
        if match_list(uid_list, banned_id):
            answer += 1
    
    return answer

に感銘を与える