leetcode （Unique Morse Code Words）

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/hsx1612727380/article/details/85219335

Title：Unique Morse Code Words  804

Difficulty：Easy

原题leetcode地址: https://leetcode.com/problems/unique-morse-code-words/

1.   Set集合的唯一性

时间复杂度：O(n^2)，嵌套for循环。

空间复杂度：O(n)，申请了Set，最长是字符串数组的长度。

    /**
     * Set集合的唯一性
     * @param words
     * @return
     */
    public static int uniqueMorseRepresentations(String[] words) {

        String sm[] = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
        Set<String> set = new HashSet<>();

        for (String word : words) {
            StringBuilder sb = new StringBuilder();
            for (char c : word.toCharArray()) {
                sb.append(sm[c - 'a']);
            }
            set.add(sb.toString());
        }

        return set.size();

    }