leetcode 460. LFU Cache

460. LFU Cache

Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.
put(key, value) - Set or insert the value if the key is not already present. When the cache reaches its capacity, it should invalidate the least frequently used item before inserting a new item. For the purpose of this problem, when there is a tie (i.e., two or more keys that have the same frequency), the least recently used key would be evicted.

Follow up:
Could you do both operations in O(1) time complexity?

Example:

LFUCache cache = new LFUCache( 2 /* capacity */ );

cache.put(1, 1);
cache.put(2, 2);
cache.get(1);       // returns 1
cache.put(3, 3);    // evicts key 2
cache.get(2);       // returns -1 (not found)
cache.get(3);       // returns 3.
cache.put(4, 4);    // evicts key 1.
cache.get(1);       // returns -1 (not found)
cache.get(3);       // returns 3
cache.get(4);       // returns 4

这个题有难度！

难度在于怎么更新fre。

class LFUCache {
public:
    LFUCache(int capacity)
    {
        cap = capacity;
    }
    
    int get(int key) {
        if (m.count(key) == 0) return -1;
        freq[m[key].second].erase(iter[key]);   //list中删除这个fre的位置
        ++m[key].second;                        //fre ++
        freq[m[key].second].push_back(key);     //在新的list中加上这个位置
        iter[key] = --freq[m[key].second].end();//保存在新list中的位置
        if (freq[minFreq].size() == 0) ++minFreq;//需要记录最低频率。方便删除。
        return m[key].first;
    }
    
    void put(int key, int value)
    {
        if (cap <= 0) return;
        if (get(key) != -1)         //在get部分就已经fre++了。
        {
            m[key].first = value;
            return;                 
        }
        
        if (m.size() >= cap)
        {
            m.erase(freq[minFreq].front()); //删除最小频率的最远距离的那个，也就是LRU
            iter.erase(freq[minFreq].front());
            freq[minFreq].pop_front();
        }
        
        m[key] = make_pair(value, 1);
        freq[1].push_back(key);
        iter[key] = --freq[1].end();
        minFreq = 1;
    }
    
private:
    int cap, minFreq;
    unordered_map<int, pair<int, int>> m;   //key - value - fre
    unordered_map<int, list<int>> freq;     //fre - list 
    unordered_map<int, list<int>::iterator> iter;   //key - list的位置
};


/**
 * Your LFUCache object will be instantiated and called as such:
 * LFUCache obj = new LFUCache(capacity);
 * int param_1 = obj.get(key);
 * obj.put(key,value);
 */

参考：https://www.cnblogs.com/grandyang/p/6258459.html