13.LeetCode 804. Unique Morse Code Words

原创于 2019-03-26 08:32:34 发布 · 154 阅读

0 ·

CC 4.0 BY-SA版权

Algorithm 同时被 2 个专栏收录

21 篇文章

订阅专栏

每日算法

21 篇文章

订阅专栏

本文介绍了一种使用Java实现的算法，该算法可以将输入的字符串数组通过摩尔斯电码进行转换，并返回不同摩尔斯电码表示的数量。利用TreeSet确保了每种组合的唯一性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

class Solution {
    public int uniqueMorseRepresentations(String[] words) {
        String[] codes = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        TreeSet<String> set = new TreeSet<String>();//基于平衡二叉树实现
        for(String word : words){
            StringBuilder ret = new StringBuilder();
            for(int i= 0;i<word.length();i++){
                ret.append(codes[word.charAt(i)-'a']);
            }
            set.add(ret.toString());
        }
        return set.size();
    }
}