leetcode学习笔记51

146. 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.

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
此题采用hashmap和链表来实现

class LRUCache {
    int capacity;
    HashMap<Integer,ListNode> map;
    ListNode head=null,tail=null;
    public LRUCache(int capacity) {
        this.capacity=capacity;
        map=new HashMap<Integer,ListNode>(capacity);
    }
    
    public int get(int key) {
        if(map.containsKey(key)){
            int value=map.get(key).val;
             turnToFirst(key,value);
            return value;
        }
        return -1;
    }
    
    public void put(int key, int value) {
        if(map.containsKey(key)){
            turnToFirst(key,value);
            return;
        }
        if(map.size()==capacity){
            deleteLast();
        }
        addFirst(key,value);
    }
    public void addFirst(int key,int value) {
        ListNode node=new ListNode(key,value);
        if(map.size()==0){
            head=node;
            tail=node;
            map.put(key,node);
            return;
        }
        head.pre=node;
        node.next=head;
        head=node;
        map.put(key,node);
    }
    public void turnToFirst(int key,int value) {
    	ListNode node=map.get(key);
    	node.val=value;
        if(map.size()==1) {
    		map.put(key,node);
    		return;
    	}
        if(node.pre==null)head=node.next;
        else node.pre.next=node.next;
        if(node.next==null)tail=node.pre;
        else node.next.pre=node.pre;
        node.pre=null;
        node.next=head;
        head.pre=node;
        head=node;
        map.put(key,node);
    }
    public void deleteLast() {
        int key=tail.key;
        if(tail.pre==null)head=null;
        else{
            tail.pre.next=null;
            tail=tail.pre;
        }
        map.remove(key);
    }
}
class ListNode{
    int key,val;
    ListNode pre,next;
    public ListNode(int key,int val){
    	this.key=key;
        this.val=val;
    }
}

/**
 * Your LRUCache object will be instantiated and called as such:
 * LRUCache obj = new LRUCache(capacity);
 * int param_1 = obj.get(key);
 * obj.put(key,value);
 */