-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path677. Map Sum Pairs.cpp
49 lines (46 loc) · 1.05 KB
/
677. Map Sum Pairs.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
class MapSum
{
public:
/** Initialize your data structure here. */
unordered_map<string, int> ump;
unordered_map<string, int> ump2;
MapSum()
{
}
void insert(string key, int val)
{
if ((ump2.find(key) == ump2.end()))
{
ump2[key] = val;
for (int i = 1; i <= key.size(); i++)
{
if (ump.find(key.substr(0, i)) != ump.end())
ump[key.substr(0, i)] += val;
else
{
ump[key.substr(0, i)] = val;
}
}
}
else
{
for (int i = 1; i <= key.size(); i++)
{
ump[key.substr(0, i)] -= ump2[key];
ump[key.substr(0, i)] += val;
}
ump2[key] = val;
}
}
int sum(string prefix)
{
return ump[prefix];
}
};
/**
* Your MapSum object will be instantiated and called as such:
* MapSum* obj = new MapSum();
* obj->insert(key,val);
* int param_2 = obj->sum(prefix);
*/
s