(int key, int value)
| 22 | } |
| 23 | |
| 24 | public void put(int key, int value) { |
| 25 | if(cache.containsKey(key)){ |
| 26 | remove(cache.get(key)); |
| 27 | } |
| 28 | if(cache.size() == capacity){ |
| 29 | remove(tail.prev); |
| 30 | } |
| 31 | Node newNode = new Node(key,value); |
| 32 | insert(newNode); |
| 33 | } |
| 34 | |
| 35 | private void remove(Node node){ |
| 36 | cache.remove(node.key); |