250x250
반응형
Notice
Recent Posts
Recent Comments
Link
목록unordered_map (1)
N
(Leet Code c++)LRU Cache
146. LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. 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-v..
Leet Code 알고리즘
2021. 8. 23. 16:06