[leetcode-in-go] 0146-LRU Cache

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.

The cache is initialized with a positive capacity.

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

解题思路

• map 记录 Key -> 链表节点的映射
• list 通过前后顺序记录数据新旧（比如最旧的总是放到头，最新的总是放到尾）
• 需要掌握 list 的用法

type LRUCache struct {
	cap int
	l   *list.List
	m   map[int]*list.Element
}

type Pair struct {
	key int
	val int
}

func Constructor(capacity int) LRUCache {
	return LRUCache{
		cap: capacity,
		l:   new(list.List),
		m:   make(map[int]*list.Element, capacity),
	}
}

func (this *LRUCache) Get(key int) int {
	if node, ok := this.m[key]; ok {
		this.l.MoveToBack(node)
		return node.Value.(*list.Element).Value.(Pair).val
	}
	return -1
}

func (this *LRUCache) Put(key int, value int) {
	if node, ok := this.m[key]; ok {
		node.Value.(*list.Element).Value = Pair{key: key, val: value}
		this.l.MoveToBack(node)
	} else {
		if len(this.m) == this.cap {
			idx := this.l.Front().Value.(*list.Element).Value.(Pair).key
			this.l.Remove(this.l.Front())
			delete(this.m, idx)
		}
		node := &list.Element{
			Value: Pair{
				key: key,
				val: value,
			},
		}
		ptr := this.l.PushBack(node)
		this.m[key] = ptr
	}
}


/**
 * Your LRUCache object will be instantiated and called as such:
 * obj := Constructor(capacity);
 * param_1 := obj.Get(key);
 * obj.Put(key,value);
 */