LeetCode--804--唯一摩尔斯密码词

最新推荐文章于 2022-11-17 13:26:14 发布

Ypopstar

最新推荐文章于 2022-11-17 13:26:14 发布

阅读量183

点赞数

分类专栏：暴力枚举面试算法

本文链接：https://blog.csdn.net/Ypopstar/article/details/106771720

版权

算法同时被 3 个专栏收录

494 篇文章 1 订阅

订阅专栏

暴力枚举

229 篇文章 0 订阅

订阅专栏

面试

119 篇文章 0 订阅

订阅专栏

题目描述：
国际摩尔斯密码定义一种标准编码方式，将每个字母对应于一个由一系列点和短线组成的字符串，比如: “a” 对应 “.-”, “b” 对应 “-…”, “c” 对应 “-.-.”, 等等。
为了方便，所有26个英文字母对应摩尔斯密码表如下：
[".-","-…","-.-.","-…",".","…-.","–.","…","…",".—","-.-",".-…","–","-.","—",".–.","–.-",".-.","…","-","…-","…-",".–","-…-","-.–","–…"]
给定一个单词列表，每个单词可以写成每个字母对应摩尔斯密码的组合。例如，“cab” 可以写成 “-.-…–…”，(即 “-.-.” + “-…” + ".-"字符串的结合)。我们将这样一个连接过程称作单词翻译。
返回我们可以获得所有词不同单词翻译的数量。
输入：
words = [“gin”, “zen”, “gig”, “msg”]
输出：
2
题意：
题目描述
题解：
用一个Set存一下返回size
代码：

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        String [] str = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        HashSet<String> set = new HashSet<>();
        int len = words.length;
        for(int i = 0; i < len; i ++){
            char [] ch = words[i].toCharArray();
            String s = "";
            for(int j = 0; j < ch.length; j ++){
                int t = ch[j] - 'a';
                s += str[t];
            }
            set.add(s);
        }
        return set.size();
    }
}