LeetCode208.677实现前缀树

LeetCode208.实现前缀树

每个前缀树节点需要一个boolean值来记录当前节点是不是终止点。还需要一个size为26的节点数组来记录这个字母下面的节点。

class Trie {
    private TrieNode root;
    class TrieNode{
        boolean flag;
        TrieNode[] nodes = new TrieNode[26];
        TrieNode(){
            flag = false;
        }
    }

    /** Initialize your data structure here. */
    public Trie() {
        root = new TrieNode();
    }
    
    /** Inserts a word into the trie. */
    public void insert(String word) {
        TrieNode head = root;
        for(int i = 0;i < word.length();i++){
            char c = word.charAt(i);
            if(head.nodes[c-'a'] == null){
                head.nodes[c-'a'] = new TrieNode();
            }
            head = head.nodes[c-'a'];
        }
        head.flag = true;
    }
    
    /** Returns if the word is in the trie. */
    public boolean search(String word) {
        TrieNode head = root;
        for(int i = 0;i < word.length();i++){
            char c = word.charAt(i);
            if(head.nodes[c-'a'] == null){
                return false;
            }
            head = head.nodes[c-'a'];
        }
        return head.flag;
    }
    
    /** Returns if there is any word in the trie that starts with the given prefix. */
    public boolean startsWith(String prefix) {
        TrieNode head = root;
        for(int i = 0;i < prefix.length();i++){
            char c = prefix.charAt(i);
            if(head.nodes[c-'a'] == null){
                return false;
            }
            head = head.nodes[c-'a'];
        }
        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);
 */

LeetCode677. Map Sum Pairs (Medium)

多了一个HashMap来存储当前键值是否已有

class MapSum {

    private TrieNode root;
    private HashMap<String,Integer> map;
    class TrieNode{
        boolean flag;
        int val;
        TrieNode[] nodes = new TrieNode[26];
    }

    /** Initialize your data structure here. */
    public MapSum() {
        root = new TrieNode();
        map = new HashMap<>();
    }
    
    public void insert(String key, int val) {
        TrieNode head = root;
        boolean flag = map.containsKey(key);
        int num = 0;
        for(int i = 0;i < key.length();i++){
            int k = key.charAt(i) - 'a';
            if(head.nodes[k] == null){
                //webvpn.bupt.edu.cn
                head.nodes[k] = new TrieNode();
            } 
            if(flag){
                head.nodes[k].val -= map.get(key);
            }      
            head.nodes[k].val += val;
            head = head.nodes[k]; 
        }
        map.put(key,val);
    }
    
    public int sum(String prefix) {
        TrieNode head = root;
        for(int i = 0;i < prefix.length();i++){
            int k = prefix.charAt(i) - 'a';
            if(head.nodes[k] == null){
                return 0;
            }
            head = head.nodes[k];
        }
        return head.val;
    }
}

/**
 * Your MapSum object will be instantiated and called as such:
 * MapSum obj = new MapSum();
 * obj.insert(key,val);
 * int param_2 = obj.sum(prefix);
 */