用HashMap+双向链表实现LRU Cache

HashMap和双向链表能保证删除加入是O(1)的。

存在get,set,remove,setHead等函数，完整代码如下

import java.util.HashMap;

public class LRU {
    int capacity;
    HashMap<Integer,Node> map=new HashMap<>();
    Node head=null;
    Node end=null;
    public LRU(int capacity){
        this.capacity=capacity;
    }
    public int get(int key){
        if(map.containsKey(key)){
            Node n=map.get(key);
            remove(n);
            setHead(n);
            printNodes("get");
            return n.val;
        }
        printNodes("get");
        return -1;
    }

    private void setHead(Node n) {
        n.next=head;
        n.pre=null;
        if(head!=null){
            head.pre=n;
        }
        head=n;
        if(end==null){
            end=head;
        }
    }

    private void printNodes(String explain) {
        System.out.print(explain+":"+head.toString());
        Node node=head.next;
        while(node!=null){
            System.out.println(node.toString());
            node=node.next;
        }
        System.out.println();
    }

    private void remove(Node n) {
        if(n.pre!=null){
            n.pre.next=n.next;
        }else{
            head=n.next;
        }
        if(n.next!=null){
            n.next.pre=n.pre;
        }else{
            end=n.pre;
        }
    }
    public void set(int key,int val){
        if(map.containsKey(key)){
            Node old=map.get(key);
            old.val=val;
            remove(old);
            setHead(old);
        }else{
            Node created=new Node(key,val);
            if(map.size()>capacity){
                map.remove(end.key);
                remove(end);
                setHead(created);
            }else{
                setHead(created);
            }
            map.put(key,created);
        }
        printNodes("set");
    }

    public static void main(String[] args) {
        LRU lru=new LRU(5);
        lru.set(1,1);
        lru.set(2,2);
        lru.set(3,3);
        lru.set(4,4);
        lru.set(5,5);
        System.out.println(lru.get(1));
        lru.set(6,6);
        System.out.println(lru.get(2));

    }
}
class Node{
    int key;
    int val;
    Node pre;
    Node next;
    public Node(int key,int value){
        this.key=key;
        this.val=val;
    }
    public String toString(){
        return this.key+"-"+this.val;
    }
}