import java.util.HashMap;
\nimport java.util.Map;<\/p>\n
public class LRUCache { public DLLNode searchCache(DLLNode dllNode){ \/\/Check if the cache size has been exhausted, if so remove the element from map if(hmDictionary) public void removeFromCache(DLLNode dllNode){ } Integer val; import java.util.HashMap; import java.util.Map; public class LRUCache { static DLLNode head; static DLLNode tail; Map hmDictionary = new HashMap(); public DLLNode searchCache(DLLNode dllNode){ return hmDictionary.get(dllNode.val); } \/\/Check if the cache size has been exhausted, if so remove the element from map public void addToCache(DLLNode dllNode){ if(hmDictionary.get(dllNode.val) == null){ hmDictionary.put(dllNode.val, dllNode); }else{ dllNode.prev.next = dllNode.next; dllNode.next… Continue reading
\n static DLLNode head;
\n static DLLNode tail;
\n Map
\n return hmDictionary.get(dllNode.val);
\n }<\/p>\n
\n public void addToCache(DLLNode dllNode){
\n if(hmDictionary.get(dllNode.val) == null){
\n hmDictionary.put(dllNode.val, dllNode);
\n }else{
\n dllNode.prev.next = dllNode.next;
\n dllNode.next = LRUCache.tail;
\n LRUCache.tail.prev = dllNode;
\n }<\/p>\n
\n }<\/p>\n
\n if(hmDictionary.get(dllNode.val) != null){
\n hmDictionary.remove(dllNode.val);
\n }
\n }<\/p>\n
\npublic class DLLNode {
\n DLLNode prev;
\n DLLNode next;<\/p>\n
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"