
-Code
import java.util.HashSet;
import java.util.Set;
public class LeetCode804 {
// Unique Morse Code Words
private static final String[] alpaConv = {
".-","-...","-.-.","-..",".","..-.","--.","....","..",".---",
"-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-",
"..-","...-",".--","-..-","-.--","--.."
};
public int uniqueMorseRepresentations(String[] words) {
Set<String> set = new HashSet<>();
for (String word : words) {
// 문자열을 주어진 변환값으로 변경 및 저장
StringBuilder sb = new StringBuilder();
for (char c : word.toCharArray()) {
sb.append(alpaConv[c - 'a']);
}
set.add(sb.toString());
}
return set.size();
}
}'알고리즘 문제 > Java' 카테고리의 다른 글
| [LeetCode/Java] Missing Number (0) | 2026.07.13 |
|---|---|
| [LeetCode/Java] Backspace String Compare (0) | 2026.07.12 |
| [LeetCode/Java] Flood Fill (0) | 2026.07.10 |
| [LeetCode/Java] Shortest Completing Word (0) | 2026.07.09 |
| [LeetCode/Java] Reverse String II (0) | 2026.07.08 |