LRU cache.
December 9, 2021
Least Recently Used (LRU) cache. We can describe this data structure using the following operations:
int get(int key)
Return the value of the key if the key exists, otherwise return -1.void put(int key, int value)
Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.