삽집하는 개발들/알고리즘

[14일차][프로그래머스][160586]대충 만든 자판

악투 2023. 6. 27. 17:26
반응형
def solution(keymap, targets):
    answer = []
    keymap_obj = {}
    
    for keys in keymap:
        for idx, key in enumerate(keys):
            if key not in keymap_obj:
                keymap_obj[key] = int(idx) + 1
            else:
                keymap_obj[key] = min(int(keymap_obj[key]), int(idx + 1))


    for idx, target in enumerate(targets):
        count = 0
        for char in target:
            if char not in keymap_obj:
                count = -1
                break
            else:
                count = count + keymap_obj[char]
                
        answer.append(count)
       

    return answer
반응형