Software Engineer/Developer Interview Question: 146. LRU Cache
Автор: 360Interview AI
Загружено: 2024-06-25
Просмотров: 5657
Описание:
Solved by 360Interview AI assistant - 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-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key.
#360interviewai #interviewquestions #softewareengineer #leetcode #leetcodesolution
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: