No.79 - LeetCode460 - C++实现LFU

最新推荐文章于 2020-04-05 09:33:22 发布

ShellDawn

最新推荐文章于 2020-04-05 09:33:22 发布

阅读量240

点赞数

分类专栏： leetcode 文章标签： LeetCode

本文链接：https://blog.csdn.net/ShellDawn/article/details/100121511

版权

leetcode 专栏收录该内容

251 篇文章 0 订阅

订阅专栏

class LFUCache {
public:
    LFUCache(int capacity) {
        cap = capacity;
    }
    
    int get(int key) {
        if(mp.count(key) == 0) return -1;
        frequency[mp[key].second].erase(storage[key]);
        mp[key].second++;
        frequency[mp[key].second].push_back(key);
        storage[key] = --frequency[mp[key].second].end();
        if(frequency[minFreq].size() == 0) minFreq++;
        return mp[key].first;
    }
    
    void put(int key, int value) {
        if(cap <= 0) return;
        if(get(key) != -1){
            mp[key].first = value;
            return;
        }
        if(mp.size() >= cap){
            mp.erase(frequency[minFreq].front());
            storage.erase(frequency[minFreq].front());
            frequency[minFreq].pop_front();
        }
        mp[key] = {value, 1};
        frequency[1].push_back(key);
        storage[key] = --frequency[1].end();
        minFreq = 1;
    }
private:
    int cap, minFreq = 0;
    unordered_map<int, pair<int, int>> mp;
    unordered_map<int, list<int>> frequency;
    unordered_map<int, list<int>::iterator> storage;
};