[leetcode]Implement Trie (Prefix Tree)

Implement Trie (Prefix Tree)

 

Implement a trie with insert, search, and startsWith methods.

Note:
You may assume that all inputs are consist of lowercase letters a-z.

题意：实现字典树的插入，查找，前缀方法

class TrieNode {
    // Initialize your data structure here.
    public TrieNode() { //默认根结点
        value = '\0';
        next = new TrieNode[26];
        isWordEnd = false;
    }
    public TrieNode(char c){
        value = c;
        next = new TrieNode[26];
        isWordEnd = false;
    }
    public TrieNode(char c, boolean endFlg){
        value = c;
        next = new TrieNode[26];
        isWordEnd = endFlg;
    }
    
    public TrieNode[] next;
    public char value;
    public boolean isWordEnd; //该字符是一个结尾字符
}

public class Trie {
    private TrieNode root;

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

    // Inserts a word into the trie.
    public void insert(String word) {
        TrieNode tmpRoot = root;
        for(int i = 0; i < word.length(); i++){
            char c = word.charAt(i);
            if(tmpRoot.next[c - 'a'] == null){
                tmpRoot.next[c - 'a'] = new TrieNode(c);  
            }
            tmpRoot = tmpRoot.next[c - 'a'];
        }
        tmpRoot.isWordEnd = true;
    }

    // Returns if the word is in the trie.
    public boolean search(String word) {
        int i = 0;
        TrieNode tmpRoot = root;
        for(; i < word.length(); i++){
            char c = word.charAt(i);
            tmpRoot = tmpRoot.next[c - 'a'];
            if(tmpRoot == null) break;
        }
        if(i == word.length() && tmpRoot.isWordEnd) return true;
        return false;
    }

    // Returns if there is any word in the trie
    // that starts with the given prefix.
    public boolean startsWith(String prefix) {
        int i = 0;
        TrieNode tmpRoot = root;
        for(; i < prefix.length(); i++){
            char c = prefix.charAt(i);
            
            tmpRoot = tmpRoot.next[c - 'a'];
            if(tmpRoot == null) break;
        }
        if(i == prefix.length()) return true;
        return false;      
    }
}

// Your Trie object will be instantiated and called as such:
// Trie trie = new Trie();
// trie.insert("somestring");
// trie.search("key");