Last active
July 13, 2022 07:45
-
-
Save bhrigu123/c561bf005b843bdb11e712385c82d9ab to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.HashMap; | |
import java.util.Map; | |
public class LRUCache<T> { | |
private final int capacity; | |
private int size; | |
private final Map<String, Node> hashmap; | |
private final DoublyLinkedList internalQueue; | |
LRUCache(final int capacity) { | |
this.capacity = capacity; | |
this.hashmap = new HashMap<>(); | |
this.internalQueue = new DoublyLinkedList(); | |
this.size = 0; | |
} | |
public T get(final String key) { | |
Node node = hashmap.get(key); | |
if(node == null) { | |
return null; | |
} | |
internalQueue.modeNodeToFront(node); | |
return hashmap.get(key).value; | |
} | |
public void put(final String key, final T value) { | |
Node currentNode = hashmap.get(key); | |
if(currentNode != null) { | |
currentNode.value = value; | |
internalQueue.modeNodeToFront(currentNode); | |
return; | |
} | |
if(size == capacity) { | |
String rearNodeKey = internalQueue.getRearKey(); | |
internalQueue.removeNodeFromRear(); | |
hashmap.remove(rearNodeKey); | |
size--; | |
} | |
Node node = new Node(key, value); | |
internalQueue.addNodeToFront(node); | |
hashmap.put(key, node); | |
size++; | |
} | |
private class Node { | |
String key; | |
T value; | |
Node next, prev; | |
public Node(final String key, final T value) { | |
this.key = key; | |
this.value = value; | |
this.next = null; | |
this.prev = null; | |
} | |
} | |
private class DoublyLinkedList { | |
private Node front, rear; | |
public DoublyLinkedList() { | |
front = rear = null; | |
} | |
private void addNodeToFront(final Node node) { | |
if(rear == null) { | |
front = rear = node; | |
return; | |
} | |
node.next = front; | |
front.prev = node; | |
front = node; | |
} | |
public void modeNodeToFront(final Node node) { | |
if(front == node) { | |
return; | |
} | |
if(node == rear) { | |
rear = rear.prev; | |
rear.next = null; | |
} else { | |
node.prev.next = node.next; | |
node.next.prev = node.prev; | |
} | |
node.prev = null; | |
node.next = front; | |
front.prev = node; | |
front = node; | |
} | |
private void removeNodeFromRear() { | |
if(rear == null) { | |
return; | |
} | |
System.out.println("Deleting key: " + rear.key); | |
if(front == rear) { | |
front = rear = null; | |
} else { | |
rear = rear.prev; | |
rear.next = null; | |
} | |
} | |
private String getRearKey() { | |
return rear.key; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
i m a noob