class LRUCache{ class Node{ Node next,pre; int val,key;//这个很关键,必须要有key,这样在删除的时候才能反向找到map的key public Node(int key, int val){ pre = null; next = null; this.val = val; this.key = key; } } int MAX_LEN; Map<...