LRU Cache

Source

• leetcode: LRU Cache | LeetCode OJ
• lintcode: (134) LRU Cache

Problem

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1.

set(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.

题解

Java

public class Solution {

    // @param capacity, an integer
    public Solution(int capacity) {
        // write your code here
    }

    // @return an integer
    public int get(int key) {
        // write your code here
    }

    // @param key, an integer
    // @param value, an integer
    // @return nothing
    public void set(int key, int value) {
        // write your code here
    }
}