820. 单词的压缩编码

题目链接：单词的压缩编码

分析：利用字典树建立一棵后缀树，然后统计存在于字典树上的单词即可，需要注意的一个点是先插入长度大的单词，这样当它的后缀出现时我们才能进行排除

class Solution {
    public int minimumLengthEncoding(String[] words) {
        int len = 0;
        Trie trie = new Trie();
        Arrays.sort(words, (s1, s2) -> s2.length() - s1.length());
        for (String word: words) {
            len += trie.insert(word);
        }
        return len;
    }
}

// 定义tire
class Trie {
    
    TrieNode root;
    
    public Trie() {
        root = new TrieNode();
    }

    public int insert(String word) {
        TrieNode cur = root;
        boolean isNew = false;
        for (int i = word.length() - 1; i >= 0; i--) {
            int c = word.charAt(i) - 'a';
            if (cur.children[c] == null) {
                isNew = true; // 是新单词
                cur.children[c] = new TrieNode();
            }
            cur = cur.children[c];
        }
        return isNew? word.length() + 1: 0;
    }
}

class TrieNode {
    char val;
    TrieNode[] children = new TrieNode[26];

    public TrieNode() {}
}

解法二：利用Set的去重性将单词的后缀去掉

class Solution {
    public int minimumLengthEncoding(String[] words) {
        HashSet<String> st = new HashSet<>();
        for (int i = 0; i < words.length; i++) {
            st.add(words[i]);
        }
        for (int i = 0; i < words.length; i++) {
            for (int j = 1; j < words[i].length(); j++) {
                st.remove(words[i].substring(j));
            }
        }
        int ans = 0;
        for (String word:st) {
            ans += word.length()+1;
        }
        return ans;       
    }
}