풀이
import java.util.*;
class Solution {
public int[] solution(String[] keymap, String[] targets) {
int[] answer = new int[targets.length];
Set<String> set = new HashSet<>(Arrays.asList(keymap));
set.remove("");
for (int i = 0; i < targets.length; i++) { // targets
for (int l = 0; l < targets[i].length(); l++) { // char
int k = 101; //임의의 값
for (String j : set) { // set
int index = j.indexOf(targets[i].charAt(l));
if (index == -1) continue;
else if (index < k) k = index;
}
if (k == 101) {
answer[i] = -1;
break;
} else answer[i] += (k + 1);
}
}
return answer;
}
}
순서대로 X 중복 허용 X
HashSet 다시 공부하기