剑指offer_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"
 

提示：

1 <= dictionary.length <= 1000
1 <= dictionary[i].length <= 100
dictionary[i] 仅由小写字母组成。
1 <= sentence.length <= 10^6
sentence 仅由小写字母和空格组成。
sentence 中单词的总量在范围 [1, 1000] 内。
sentence 中每个单词的长度在范围 [1, 1000] 内。
sentence 中单词之间由一个空格隔开。
sentence 没有前导或尾随空格。

代码：

class Solution {
    public String replaceWords(List<String> dictionary, String sentence) {
        Tree tree = new Tree();
        for (String str : dictionary) {
            tree.insert(str);
        }
        StringBuilder stringBuilder = new StringBuilder();
        String[] sen = sentence.split(" ");
        for (String str : sen) {
            String temp = tree.search(str);
            stringBuilder.append(temp).append(" ");
            
            
        }
        stringBuilder.deleteCharAt(stringBuilder.length() - 1);
        return stringBuilder.toString();
    }

    class TreeNode {
        TreeNode[] next = new TreeNode[26];
        boolean isEnd = false;
    }

    class Tree {
        TreeNode root = new TreeNode();
        public void insert(String str) {
            TreeNode cur = root;
            for (char c : str.toCharArray()) {
                int index = c - 'a';
                if (cur.next[index] == null) {
                    cur.next[index] = new TreeNode();
                }
                cur = cur.next[index];
            
            }
            cur.isEnd = true;
        }

        public String search(String str) {
            TreeNode cur = root;
            for (int i = 0; i < str.length(); i++) {
                int index = str.charAt(i) - 'a';
                if (cur.next[index] == null) {
                    return str;
                }
                cur = cur.next[index];
                if (cur.isEnd == true) {
                    return str.substring(0, i + 1);
                }
            }
            return str;
        }
    }
}

解题思路：

和上道题是一样的，定义节点，定义树，定义方法，只不过在查找的时候有一点不同，如果查找的前缀的话就直接返回前缀字符串就行啦。最后注意 StringBuilder 的正确使用。

注意：

年轻人少熬夜。

参考链接：

力扣