Leetcode648 Replace Words

最新推荐文章于 2026-05-11 11:02:43 发布

原创最新推荐文章于 2026-05-11 11:02:43 发布 · 178 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode

Trie

本文介绍了一个LeetCode题目解决方案，通过构建Trie树来高效地查找并替换句子中每个单词的最短前缀。代码示例展示了如何插入词汇到Trie树以及如何搜索词汇的最短前缀。

https://leetcode.com/problems/replace-words/

就是要找出每个单词的最短前缀，使用Trie来做。

import java.util.List;

/**
 * Created by dezhonger on 2019/7/17
 * trie
 */
public class Leetcode0648 {

    public String replaceWords(List<String> dict, String sentence) {
        Trie trie = new Trie();
        for (String word : dict) insert(trie, word);
        StringBuilder res = new StringBuilder();
        for (String word : sentence.split(" ")) {
            String tmp = findPrefix(trie, word);
            res.append(tmp);
            res.append(" ");
        }
        return res.toString().trim();
    }


    private void insert(Trie root, String word) {
        for (char c : word.toCharArray()) {
            if (root.children[c - 'a'] == null) root.children[c -'a'] = new Trie(c);
            root = root.children[c - 'a'];
        }
        root.isEnd = true;
    }

    private String findPrefix(Trie root, String word) {
        StringBuilder r = new StringBuilder();
        for (char c : word.toCharArray()) {
            Trie trie = root.children[c - 'a'];
            if (trie == null) break;
            r.append(c);
            root = trie;
            if (root.isEnd) return r.toString();
        }
        return word;
    }

    class Trie {
        char val;
        Trie[] children;
        boolean isEnd;

        public Trie() {
            children = new Trie[26];
            this.isEnd = false;
        }

        public Trie(char val) {
            this.val = val;
            children = new Trie[26];
            this.isEnd = false;
        }
    }
}