实现一个前缀树，包含insert，search和startWith这三个操作

前缀树

package cn.hq;

/**
 * @Author: hq
 * @Date: 2021/3/2 16:21
 * @Description:实现一个前缀树，包含insert，search和startWith这三个操作
 * 前缀树：
 */
class Node {
    boolean isEnd = false;
    // 假设该结点有26个子节点（26个字母）
    Node[] next = new Node[26];

    //设置该结点是叶子节点（字符串结尾）
    public void setIsEnd () {
        this.isEnd = true;
    }
}


public class MyTree {
    Node root;
    public MyTree()  {
        root = new Node();
    }

    public void insert(String string) {
        char[] str = string.toCharArray();
        Node node = root;
        for (int i = 0; i < str.length; i++) {
            int temp = str[i] - 'a';  //获得待插入字母的序号
            if (node.next[temp] == null)
                node.next[temp] = new Node();
            node = node.next[temp];
        }
        node.setIsEnd();
    }

    public boolean search(String string) {
        char[] str=string.toCharArray();
        Node node=root;
        for(int i=0;i<str.length;i++){
            int temp=str[i]-'a';
            if(node.next[temp]==null) return false;
            node=node.next[temp];
        }
        return node.isEnd;
    }

    public boolean startsWith(String string) {
        char[] str = string.toCharArray();
        Node node = root;
        for (int i = 0; i < str.length; i++) {
            int temp = str[i] - 'a';
            if (node.next[temp] == null) return false;
            node = node.next[temp];
        }
        return true;
    }

    public static void main(String[] args) {
        MyTree tree=new MyTree();
        tree.insert("apple");
        System.out.println(tree.search("apple"));  //true
        System.out.println(tree.search("app"));    //false
        tree.startsWith("app");
        tree.insert("app");
        System.out.println(tree.search("app"));    //true
    }
}