LRU Cache

题目

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.

方法

	class Node {
		
		int key;
		int value;
		Node next = null;
		Node pre = null;
		public Node (int key, int value) {
			this.key = key;
			this.value = value;
		}
	}
    private Map<Integer, Node> cache = null;
 	private int capacity = 0;
	private Node head = null;
	private Node tail = null;
    public LRUCache(int capacity) {
    	cache = new HashMap<Integer, Node>();
    	head = new Node(-1, -1);
    	tail = new Node(-1, -1);
    	head.next = tail;
    	tail.pre = head;
        this.capacity = capacity;
    }
    
    public int get(int key) {
    	
    	if (!cache.containsKey(key)) {
    		return -1;
    	} else {
    		Node cur = cache.get(key);
    		update(cur);
    		return cur.value;
    	}
        
    }
    
    private void insert(Node cur) {
    	cur.next = head.next;
    	head.next.pre = cur;
    	head.next = cur;
    	cur.pre = head;
    }
    
    private int delete() {
    	Node last = tail.pre;
    	tail.pre = last.pre;
    	last.pre.next = tail;
    	return last.key;
    }
    
    private void update(Node cur) {
    	cur.pre.next = cur.next;
    	cur.next.pre = cur.pre;
    	//插入到开头
    	cur.next = head.next;
    	head.next.pre = cur;
    	head.next = cur;
    	cur.pre = head;
    }
    
    public void set(int key, int value) { 	
    	if (!cache.containsKey(key)) {
    		//cache中没有该key
    		System.out.println("A :" + cache.size());
    		if (cache.size() == capacity) {
    			//等于capacity
    			//delete
    			int res = delete();
    			cache.remove(res);
    			System.out.println("B :" + cache.size());
    		} 
			Node temp = new Node(key, value);
			cache.put(key, temp);
			insert(temp);
    	} else {
    		//cache中有该key
    		Node cur = cache.get(key);
    		cur.value = value;
    		update(cur);
    	}
    }
    
    public int size() {
    	return cache.size();
    }