[프로그래머스 lv1] 대충 만든 자판

문제 보기

https://school.programmers.co.kr/learn/courses/30/lessons/160586

프로그래머스

 

소스 코드

import java.util.*;
class Solution {
    public int[] solution(String[] keymap, String[] targets) {
        int[] answer = new int[targets.length];
        
        Map<Character, Integer> map = new HashMap<>();
        for (int i=0; i<keymap.length; i++) {
            for (int j=0; j<keymap[i].length(); j++) {
                char c = keymap[i].charAt(j);
                if (!map.containsKey(c)) {
                    map.put(c, j+1);
                } else {
                    map.put(c, Math.min(map.get(c), j+1));
                }
            }
        }
   
        for (int i=0; i<targets.length; i++) {
            int count = 0;
            for (int j=0; j<targets[i].length(); j++) {
                char c = targets[i].charAt(j);
                if (map.containsKey(c)) {
                    count += map.get(c);
                } else {
                    count = -1;
                    break;
                }       
            }
            answer[i] = count;
        }
 
        return answer;
    }
}