804. 唯一摩尔斯密码词（Java实现）

最新推荐文章于 2022-04-10 20:02:17 发布

Mrrr_Li

最新推荐文章于 2022-04-10 20:02:17 发布

阅读量145

点赞数

分类专栏：力扣笔记文章标签：字符串 leetcode java

本文链接：https://blog.csdn.net/Mrrr_Li/article/details/110569571

版权

笔记同时被 2 个专栏收录

203 篇文章 1 订阅

订阅专栏

力扣

78 篇文章 0 订阅

订阅专栏

在这里插入图片描述
使用StringBuilder拼接字符串，HashSet去重

class Solution {
        public int uniqueMorseRepresentations(String[] words) {
            if ( words.length == 0) return 0;
            int j = 0;
            String[] res = new String[words.length];
            String[] strings = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
            for (String s : words){
                StringBuilder sb = new StringBuilder();
                for (int i = 0; i < s.length(); i++){
                    sb.append(strings[s.charAt(i) - 97]);
                }
                res[j++] = sb.toString();
            }
            HashSet<String> hashSet = new HashSet<>();
            for (String str : res){
                hashSet.add(str);
            }
            return hashSet.size();
        }
    }