804. Unique Morse Code Words - LeetCode

最新推荐文章于 2024-07-09 23:56:48 发布

weixin_34167043

最新推荐文章于 2024-07-09 23:56:48 发布

阅读量99

点赞数

文章标签：数据结构与算法 java

原文链接：https://my.oschina.net/yysue/blog/1932423

版权

为什么80%的码农都做不了架构师？>>>

Question

804. Unique Morse Code Words

[".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."]

Solution

题目大意：

根据对应的编码规则将字符串数组中每个字符串编码，这样就得到一个编码后的数组，数组去重后返回数组大小

思路：用set来保存编码后的字符串

Java实现：

public int uniqueMorseRepresentations(String[] words) {
    String[] arr = {".-", "-...", "-.-.", "-..", ".", "..-.", "--.", "....", "..", ".---", "-.-", ".-..", "--", "-.", "---", ".--.", "--.-", ".-.", "...", "-", "..-", "...-", ".--", "-..-", "-.--", "--.."};
    Set<String> codeSet = new HashSet<>();
    for (String word : words) {
        String code = "";
        for (char c : word.toCharArray()) {
            code += arr[c - 'a'];
        }
        /*if (!codeSet.contains(code)) {
            codeSet.add(code);
        }*/
        codeSet.add(code);
    }
    return codeSet.size();
}

转载于:https://my.oschina.net/yysue/blog/1932423