关于前缀树的生成删除查询

前缀树节点的定义

public static class TrieNode {
        public int pass;
        public int end;
        public TrieNode[] nexts;

        public TrieNode() {
            pass = 0;
            end = 0;
            nexts = new TrieNode[26];  //符号有多少 就生成多少叉树
        }
    }

前缀树的定义

public static class Tire {
        public TrieNode root;

        public Tire() {
            root = new TrieNode();
        }
   }

前缀树的插入

public void insert(String word) {
            if (word == null) return;

            char[] chars = word.toCharArray();

            TrieNode node = root;
            node.pass++;
            int index = 0;
            for (int i = 0; i < chars.length; i++) {
                index = chars[i] - 'a';

                if (node.nexts[index] == null) {
                    node.nexts[index] = new TrieNode();
                }

                node = node.nexts[index];
                node.pass++;
            }
            node.end++;
        }

前缀树的删除

public void delete(String word) {
            if (search(word) != 0) {
                char[] chars = word.toCharArray();

                TrieNode node = root;
                node.pass--;
                int index = 0;
                for (int i = 0; i < chars.length; i++) {
                    index = chars[i] - 'a';

                    if (--node.nexts[index].pass == 0) {
                        node.nexts[index] = null;
                        return;
                    }

                    node = node.nexts[index];

                }

                node.end--;
            }
        }

前缀树的字符串查找

public int search(String word) {
            if (word == null) {
                return 0;
            }

            char[] chars = word.toCharArray();

            TrieNode node = root;
            int index = 0;

            for (int i = 0; i < chars.length; i++) {
                index = chars[i] - 'a';

                if (node.nexts[index] == null) {
                    return 0;
                }

                node = node.nexts[index];
            }
            return node.end;
        }

前缀树带有某前缀的字符串查找

public int profixNumber(String pre) {
            if (pre == null) {
                return 0;
            }

            char[] chars = pre.toCharArray();
            TrieNode node = root;
            int index = 0;

            for (int i = 0; i < chars.length; i++) {
                index = chars[i]-'a';

                if (node.nexts[index]==null){
                    return  0;
                }

                node = node.nexts[index];
            }
            return  node.pass;
        }