LRU(最近最少使用)
struct DLinkedNode {
int key, value;
DLinkedNode* prev;
DLinkedNode* next;
DLinkedNode(): key(0), value(0), prev(nullptr), next(nullptr) {}
DLinkedNode(int _key, int _value): key(_key), value(_value), prev(nullptr), next(nullptr) {}
};
class LRUCache {
private:
unordered_map<int, DLinkedNode*> cache;
DLinkedNode* head;
DLinkedNode* tail;
int size;
int capacity;
public:
LRUCache(int _capacity): capacity(_capacity), size(0) {
head = new DLinkedNode();
tail = new DLinkedNode();
head->next = tail;
tail->prev = head;
}
int get(int key) {
if (!cache.count(key))
return -1;
DLinkedNode* node = cache[key];
moveToHead(node);
return node->value;
}
void put(int key, int value) {
if (!cache.count(key)) {
DLinkedNode* node = new DLinkedNode(key, value);
cache[key] = node;
addToHead(node);
++size;
if (size > capacity) {
DLinkedNode* removed = removeTail();
cache.erase(removed->key);
delete removed;
--size;
}
}
else {
DLinkedNode* node = cache[key];
node->value = value;
moveToHead(node);
}
}
void addToHead(DLinkedNode* node) {
node->prev = head;
node->next = head->next;
head->next->prev = node;
head->next = node;
}
void removeNode(DLinkedNode* node) {
node->prev->next = node->next;
node->next->prev = node->prev;
}
void moveToHead(DLinkedNode* node) {
removeNode(node);
addToHead(node);
}
DLinkedNode* removeTail() {
DLinkedNode* node = tail->prev;
removeNode(node);
return node;
}
};
LFU(最不经常使用)
struct node {
int cnt, time, key, value;
node(int _cnt, int _time, int _key, int _value) {
cnt = _cnt;
time = _time;
key = _key;
value = _value;
}
bool operator <(const node& rhs) const {
return cnt == rhs.cnt ? time < rhs.time : cnt < rhs.cnt;
}
};
class LFUCache {
int capacity, time;
unordered_map<int, node> key_table;
set<node> S;
public:
LFUCache(int _capacity) {
capacity = _capacity;
time = 0;
key_table.clear();
S.clear();
}
int get(int key) {
if (!capacity) return -1;
auto it = key_table.find(key);
if (it == key_table.end()) return -1;
node cache = it->second;
S.erase(cache);
cache.cnt += 1;
cache.time = ++time;
S.insert(cache);
it->second = cache;
return cache.value;
}
void put(int key, int value) {
if (!capacity) return;
auto it = key_table.find(key);
if (it == key_table.end()) {
if (key_table.size() == capacity) {
key_table.erase(S.begin()->key);
S.erase(S.begin());
}
node cache = node(1, ++time, key, value);
key_table.insert({key, cache});
S.insert(cache);
}
else {
node cache = it->second;
S.erase(cache);
cache.cnt += 1;
cache.time = ++time;
cache.value = value;
S.insert(cache);
it->second = cache;
}
}
};