[leetcode] problem 648 – replace words

In English, we have a concept called root, which can be followed by some other words to form another longer word - let’s call this word successor. For example, the root an, followed by other, which can form another word another.

Now, given a dictionary consisting of many roots and a sentence. You need to replace all the successor in the sentence with the root forming it. If a successor has many roots can form it, replace it with the root with the shortest length.

You need to output the sentence after the replacement.

Example

Input: dict = [“cat”, “bat”, “rat”]

sentence = “the cattle was rattled by the battery”

Output: “the cat was rat by the bat”

Note

The input will only have lower-case letters.
1 <= dict words number <= 1000
1 <= sentence words number <= 1000
1 <= root length <= 100
1 <= sentence words length <= 1000

Code

public class  {
    private String word;
    private Map<Character, TrieNode> children = new HashMap<>();
}

public class TrieTree {
    private TrieNode root;

    public TrieTree(TrieNode root) {
        this.root = root;
    }

    public void insert(String word) {
        TrieNode node = root;

        for (int i = 0; i < word.length(); i++) {
            char ch = word.charAt(i);
            node.children.putIfAbsent(ch, new TrieNode());
            node = node.children.get(ch);
        }

        node.word = word;
    }

    public String find(String word) {
        TrieNode node = root;

        for (int i = 0; i < word.length(); i++) {
            char ch = word.charAt(i);

            if (!node.children.containsKey(ch))
                break;

            node = node.children.get(ch);

            if (node.word != null)
                return node.word;
        }

        return word;
    }
}

public String replaceWords(List<String> dict, String sentence) {
    StringBuilder sb = new StringBuilder();
    TrieTree trieTree = new TrieTree(new TrieNode());

    for (String word : dict)
        trieTree.insert(word);

    String[] words = sentence.split(" ");

    for (String word : words)
        sb.append(trieTree.find(word)).append(" ");

    return sb.toString().trim();
}

[leetcode] problem 648 – replace words

Example

Note

Code

近期文章

近期评论

标签

热门

文章归档

分类目录

功能