Leetcode-List-Hash

Design and implement a data structure for Least Recently Used (LRU) 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 reached its capacity, it should invalidate the least recently used item before inserting a new item.

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

Example:

LRUCache cache = new LRUCache( 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.put(4, 4); // evicts key 1
cache.get(1); // returns -1 (not found)
cache.get(3); // returns 3
cache.get(4); // returns 4

#include <list>
#include <string>
#include <iterator>
#include <iomanip>
#include <utility> 
#include <memory>
#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

using namespace std;

typedef vector<pair<pair<int/*key*/, int/*value*/>, size_t/*age*/>> numsT;

typedef vector<numsT::iterator> ptrsT;

typedef list<pair<int, int>> LINT;
typedef unordered_map<int/*key*/, LINT::iterator> MAP;
class LRUCache {

public:


    LRUCache(int capacity): _capacity(capacity),len(0) {
    }
    int get(int key) {
        auto resf = mmap.find(key);
        if (resf != mmap.end()) {
            int res =  (*(resf->second)).second;
            update(resf->second);
            return res;
        } else return -1;
    }
    void put(int key, int value) {
        auto resf = mmap.find(key);
        if (resf != mmap.end()) {
            resf->second->second = value;
            update(resf->second);
        } else {
            if (len >= _capacity) {
                auto it = mlis.end();
                it--;
                mmap.erase(it->first);
                it = mlis.erase(it);
            } else {
                len++;
            }
            pair<int, int> ele(key, value);
            mlis.push_front(ele);
            mmap[key] = mlis.begin();
        }
    }

private:

    int _capacity, len;
    LINT mlis;
    MAP mmap;
    LINT::iterator update(LINT::iterator it){
        decltype(*it) ele = *it;
        it = mlis.erase(it);
        mlis.push_front(ele);
        mmap[ele.first] = mlis.begin();
        return it;
    }




};