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

提示：

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 没有前导或尾随空格。

AC代码

const int TRIE_NODE_SIZE = 26;

// 字典树节点
struct TrieNode {
    TrieNode* next[TRIE_NODE_SIZE];
    bool isEnd;
    int times; // 记录出现次数
    TrieNode()
    {
        for (int i = 0; i < TRIE_NODE_SIZE; ++i) {
            next[i] = nullptr;
            isEnd = false;
            times = 0;
        }
    }
};

// 字典树
class Trie {
public:
    Trie() {
        root = new TrieNode();
    }
    
    void insert(string word) {
        TrieNode* node = root;
        for (const auto& ch : word) {
            if (node->next[ch - 'a'] == nullptr) {
                node->next[ch - 'a'] = new TrieNode();
            }
            node = node->next[ch - 'a'];
        }
        node->isEnd = true;
        node->times++;
    }
    
    bool search(string word) {
        TrieNode* node = root;
        for (const auto& ch : word) {
            if (node->next[ch - 'a'] != nullptr) {
                node = node->next[ch - 'a'];
            } else {
                return false;
            }
        }
        return node->isEnd;
    }

public:
    TrieNode* root; // 根节点
};

class Solution {
public:
    string replaceWords(vector<string>& dictionary, string sentence) {
        string result;
        // 建立词根树
        Trie* trie = new Trie();
        for (const auto& root : dictionary) {
            trie->insert(root);
        }
        // 查找sentence中每个单词的前缀，遇到查找下一个单词的
        string tmpStr;
        bool flag = false;  //标记是否忽略掉后面的字符
        for (const auto& ch : sentence) {
            if (ch != ' ') {
                if (!flag) {
                    tmpStr += ch;
                }
                if (trie->search(tmpStr)) {
                    flag = true;   // 忽略掉后面的字符直到遇见空格
                }
            } else {
                result += (tmpStr + " ");
                tmpStr = "";
                flag = false;
            }
        }
        // 最后一个单词
        result += tmpStr;
        return result;
    }
};