力扣 804. 唯一摩尔斯密码词

题目

国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串， 比如:

‘a’ 对应 “.-” ，
‘b’ 对应 “-…” ，
‘c’ 对应 “-.-.” ，以此类推。
为了方便，所有 26 个英文字母的摩尔斯密码表如下：

[“.-”,“-…”,“-.-.”,“-…”,“.”,“…-.”,“–.”,“…”,“…”,“.—”,“-.-”,“.-…”,“–”,“-.”,“—”,“.–.”,“–.-”,“.-.”,“…”,“-”,“…-”,“…-”,“.–”,“-…-”,“-.–”,“–…”]
给你一个字符串数组 words ，每个单词可以写成每个字母对应摩尔斯密码的组合。

例如，“cab” 可以写成 “-.-…–…” ，(即 “-.-.” + “.-” + “-…” 字符串的结合)。我们将这样一个连接过程称作 单词翻译 。
对 words 中所有单词进行单词翻译，返回不同 单词翻译 的数量。

示例

输入: words = [“gin”, “zen”, “gig”, “msg”]
输出: 2
解释:
各单词翻译如下:
“gin” -> “–…-.”
“zen” -> “–…-.”
“gig” -> “–…–.”
“msg” -> “–…–.”

共有 2 种不同翻译, “–…-.” 和 “–…–.”.

输入：words = [“a”]
输出：1

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/unique-morse-code-words
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

方法1

HashSet Java实现

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        String[] mosi = new String[]{".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        Set<String> set = new HashSet<>();
        for (String str : words) {
            StringBuffer sb = new StringBuffer();
            for (int i = 0; i < str.length(); i++) {
                sb.append(mosi[str.charAt(i) - 'a']);
            }
            if (!set.contains(sb.toString())) set.add(sb.toString());
        }

        return set.size();
    }
}

HashMap Java实现

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        int n = words.length;
        String[] mosi = new String[]{".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        Map<String, Integer> map = new HashMap<>();

        for (String str : words) {
            StringBuffer sb = new StringBuffer();
            for (char c : str.toCharArray()) {
                sb.append(mosi[c - 'a']);
            }
            String var = sb.toString();
            map.put(var, map.getOrDefault(var, 0) + 1);
        }
        return map.keySet().size();
    }
}