All contents and pictures on this website come from the Internet and are updated regularly every week. They are for personal study and research only, and should not be used for commercial purposes. Thank you for your cooperation.
Implement a data structure supporting the following operations:
- Inc(Key) - Inserts a new key
with value 1. Or increments an existing key by 1. Key is guaranteed to be a non-empty
string.
- Dec(Key) - If Key's value is 1, remove it from the data structure. Otherwise decrements
an existing key by 1. If the key does not exist, this function does nothing. Key is
guaranteed to be a non-empty string.
- GetMaxKey() - Returns one of the keys with maximal value. If no element exists, return
an empty string
""
.
- GetMinKey() - Returns one of the keys with minimal value. If no element exists, return
an empty string
""
.
Challenge: Perform all these in O(1) time complexity.
Difficulty:
Hard
Lock:
Normal
All contents and pictures on this website come from the Internet and are updated regularly every week. They are for personal study and research only, and should not be used for commercial purposes. Thank you for your cooperation.