LeetCode 刷题之路 Map Sum Pairs

17 篇文章 0 订阅
17 篇文章 0 订阅

Map Sum Pairs

Implement a MapSum class with insert, and sum methods.

For the method, insert, you'll be given a pair of (string, integer). The string represents the key and the integer represents the value. If the key already existed, then the original key-value pair will be overridden to the new one.

For the method, sum, you'll be given a string representing the prefix, and you need to return the sum of all the pairs' value whose key starts with the prefix.

Example 1:

Input: insert("apple", 3), Output: Null
Input: sum("ap"), Output: 3
Input: insert("app", 2), Output: Null
Input: sum("ap"), Output: 5

这题利用Tire, 每次插入数的时候加入一个判断来决定是否需要更新数值,同样的,对于其所在的prefix也需要更新改变。这题代码我是直接用的官网给出的代码,详细资料可以点击这个链接

import java.util.HashMap;
import java.util.Map;
class MapSum {

    class TireNode{
        public Map<Character, TireNode> children;
        public int score;
        public TireNode(){
            children = new HashMap<>();
            score = 0;
        }
    }

    public HashMap<String, Integer> map;
    public TireNode root;

    /** Initialize your data structure here. */
    public MapSum() {
        root = new TireNode();
        map = new HashMap<>();
    }

    public void insert(String key, int val) {
        // Get the difference if we reinsert the old key
        int delta = val - map.getOrDefault(key, 0);
        map.put(key,val);
        TireNode root = this.root;

        // Update the score
        root.score += delta;

        //Insert the key
        for(char cur : key.toCharArray()){
            // when the character does not exist, add new TireNode
            root.children.putIfAbsent(cur, new TireNode());
            root = root.children.get(cur);
            root.score += delta;
        }
    }

    public int sum(String prefix) {
        TireNode root = this.root;
        for(char cur : prefix.toCharArray()){
            root = root.children.get(cur);
            if(root == null){
                return 0;
            }
        }
        return root.score;
    }
}

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

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值