首页 > itarticle > nail your next job interview trie

nail your next job interview trie

admin 11月 14, 2020 0

Summary

implement trie (prefix tree)

Implmentaton of trie

Array of TrieNode (lower case letter):

private class  { 
    private boolean isWord;
    private TrieNode[] children;
    
    public () {
        this.isWord = false;
        this.children = new TrieNode[26];
    }
}

HashMap w/ boolean

private class  { 
    private boolean isWord;
    private Map<Character, TrieNode> children;
    
    public () {
    	isWord = false;
    	children = new HashMap<>();
    } 
}

HashMap w/ String

private class  { 
    private String word;
    private Map<Character, TrieNode> children;
    
    public TrieNode() {
    	word = null;
    	children = new HashMap<>();
    } 
}

HashMap w/ List of Strings

TODO:

private class TrieNode { 
    List<String> words;
    private Map<Character, TrieNode> children;
    
    public TrieNode() {
    	word = null;
    	children = new HashMap<>();
    } 
}

TD: how to represent trie in interview