力扣：208. 实现 Trie (前缀树)

最新推荐文章于 2024-08-10 22:52:22 发布

what is an object

最新推荐文章于 2024-08-10 22:52:22 发布

阅读量117

点赞数

分类专栏：菜鸟刷题记录算法文章标签： leetcode java 算法

本文链接：https://blog.csdn.net/newOneObject/article/details/125669187

版权

算法同时被 2 个专栏收录

278 篇文章 1 订阅

订阅专栏

菜鸟刷题记录

204 篇文章 1 订阅

订阅专栏

这篇博客介绍了如何使用链表对象和数组两种方式实现字典树（Trie）数据结构。字典树是一种用于快速查找字符串的有效数据结构，这里分别展示了基于节点类的链表实现和基于二维数组的实现。插入、搜索和判断前缀的功能都得到了详细说明。

摘要由CSDN通过智能技术生成

链表对象的方式实现

class Trie {
    class Node{
        boolean end;
        // 26个字母
        Node[] tns = new Node[26];
    }

    Node root;
    public Trie() {
        root = new Node();
    }
    
    public void insert(String word) {
        Node p = root;
        for (int i = 0; i < word.length(); i++){
            int u = word.charAt(i) - 'a';
            if (p.tns[u] == null){
                p.tns[u] = new Node();
            }
            p = p.tns[u];
        }
        p.end = true;
    }
    
    public boolean search(String word) {
        Node p = root;
        for (int i = 0; i < word.length(); i++){
            int u = word.charAt(i) - 'a';
            if (p.tns[u] == null){
                return false;
            }
            p = p.tns[u];
        }
        return p.end;
    }
    
    public boolean startsWith(String prefix) {
        Node p = root;
        for (int i = 0; i < prefix.length(); i++){
            int u = prefix.charAt(i) - 'a';
            if (p.tns[u] == null){
                return false;
            }
            p = p.tns[u];
        }
        return true;
    }
}

/**
 * Your Trie object will be instantiated and called as such:
 * Trie obj = new Trie();
 * obj.insert(word);
 * boolean param_2 = obj.search(word);
 * boolean param_3 = obj.startsWith(prefix);
 */

数组的方式实现

class Trie {
    int n ;
    int m;
    boolean[] end;
    int[][] tr;
    int idx;
    public Trie() {
        n = 100009;
        m = 26;
        end = new boolean[n];
        tr = new int[n][m];
        idx = 0;
    }
    
    public void insert(String word) {
        int p = 0;
        for (int i = 0; i < word.length(); i++){
            int u = word.charAt(i) - 'a';
            if (tr[p][u] == 0){
                tr[p][u] = ++idx;
            }
            p = tr[p][u];
        }
        end[p] = true;
    }
    
    public boolean search(String word) {
        int p = 0;
        for (int i = 0; i < word.length(); i++){
            int u = word.charAt(i) - 'a';
            if (tr[p][u] == 0){
                return false;
            }
            p = tr[p][u];
        }
        return end[p];
    }
    
    public boolean startsWith(String prefix) {
        int p = 0;
        for (int i = 0; i < prefix.length(); i++){
            int u = prefix.charAt(i) - 'a';
            if (tr[p][u] == 0){
                return false;
            }
            p = tr[p][u];
        }
        return true;
    }
}

/**
 * Your Trie object will be instantiated and called as such:
 * Trie obj = new Trie();
 * obj.insert(word);
 * boolean param_2 = obj.search(word);
 * boolean param_3 = obj.startsWith(prefix);
 */