mirror of
https://github.com/autistic-symposium/master-algorithms-py.git
synced 2025-04-29 12:16:14 -04:00
Delete map_sum.py
This commit is contained in:
parent
044afb8d21
commit
ba0780c240
@ -1,42 +0,0 @@
|
||||
#!/usr/bin/env python3
|
||||
# -*- coding: utf-8 -*-
|
||||
# author: bt3gl
|
||||
|
||||
'''
|
||||
Design a map that allows you to do the following:
|
||||
- Maps a string key to a given value.
|
||||
- Returns the sum of the values that have a key with a prefix equal to a given str.
|
||||
'''
|
||||
|
||||
class Node:
|
||||
|
||||
def __init__(self):
|
||||
self.children = {}
|
||||
self.score = 0
|
||||
|
||||
|
||||
class MapSum:
|
||||
|
||||
def __init__(self):
|
||||
self.map = {}
|
||||
self.root = Node()
|
||||
|
||||
def insert(self, key: str, val: int) -> None:
|
||||
delta = val - self.map.get(key, 0)
|
||||
self.map[key] = val
|
||||
|
||||
node = self.root
|
||||
node.score += delta
|
||||
for c in key:
|
||||
node = node.children.setdefault(c, Node())
|
||||
node.score += delta
|
||||
|
||||
def sum(self, prefix: str) -> int:
|
||||
node = self.root
|
||||
for c in prefix:
|
||||
if c not in node.children:
|
||||
return 0
|
||||
node = node.children[c]
|
||||
|
||||
return node.score
|
||||
|
Loading…
x
Reference in New Issue
Block a user