剑指 Offer II 063. 替换单词

在英语中，有一个叫做 词根(root) 的概念，它可以跟着其他一些词组成另一个较长的单词——我们称这个词为 继承词(successor)。例如，词根an，跟随着单词 other(其他)，可以形成新的单词 another(另一个)。

现在，给定一个由许多词根组成的词典和一个句子，需要将句子中的所有继承词用词根替换掉。如果继承词有许多可以形成它的词根，则用最短的词根替换它。

需要输出替换之后的句子。

示例 1：

输入：dictionary = [“cat”,“bat”,“rat”], sentence = “the cattle was rattled by the battery”
输出：“the cat was rat by the bat”
示例 2：

输入：dictionary = [“a”,“b”,“c”], sentence = “aadsfasf absbs bbab cadsfafs”
输出：“a a b c”
示例 3：

输入：dictionary = [“a”, “aa”, “aaa”, “aaaa”], sentence = “a aa a aaaa aaa aaa aaa aaaaaa bbb baba ababa”
输出：“a a a a a a a a bbb baba a”
示例 4：

输入：dictionary = [“catt”,“cat”,“bat”,“rat”], sentence = “the cattle was rattled by the battery”
输出：“the cat was rat by the bat”
示例 5：

输入：dictionary = [“ac”,“ab”], sentence = “it is abnormal that this solution is accepted”
输出：“it is ab that this solution is ac”

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/UhWRSj

class Solution {
	//前缀树内部类
    class TrieNode{
        public boolean isWord;  //用于判断到某个字母时是否为一个单词
        public Map<Character,TrieNode> map = new HashMap<>();   //存放子节点
    }
    public String replaceWords(List<String> dictionary, String sentence) {
        TrieNode node = insert(dictionary);
        StringBuilder sb = new StringBuilder();
        String[] str = sentence.split(" ");
        for(String s:str){
            String cur = search(node,s);
            if(cur!=""){
            	//前缀树中有前缀
                sb.append(cur);
            }else{
            	//没有前缀用原来的单词
                sb.append(s);
            }
            sb.append(" ");
        }
        return sb.toString().trim();
    }
	
	//生成前缀树
    public TrieNode insert(List<String> dictionary){
        TrieNode root = new TrieNode();
        for(String str:dictionary){
            TrieNode cur = root;
            for(int i = 0;i < str.length();i++){
                char c = str.charAt(i);
                //判断子节点中是否已经包含字母c
                if(!cur.map.containsKey(c)){
                	//没有则将字母c加入到子节点中
                    cur.map.put(c,new TrieNode());
                }
                cur = cur.map.get(c);
            }
            cur.isWord = true;
        }
        return root;
    }
	//搜索前缀树中是否有前缀
    public String search(TrieNode root,String s){
        String res = "";
        TrieNode cur = root;
        for(int i = 0;i < s.length();i++){
            char c = s.charAt(i);
            if(cur.map.containsKey(c)){
                res += c;
                cur = cur.map.get(c);
                //返回最小前缀，比如s=aaaa,前缀树中含有a、aa，则应该返回a
                if(cur.isWord)
                    break;   
            }else{
                break;
            }
        }
        if(!cur.isWord) return "";
        return res;
    }
}