Commitd76dbfe

committed

HARD/src/hard/LRUCache_use_LinkedHashMap.java

1 parenta8edbc1 commitd76dbfeCopy full SHA for d76dbfe

File tree

+32

-0

lines changed

+32

-0

lines changed

Lines changed: 32 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,32 @@`
	`1`	`+packagehard;`
	`2`	`+`
	`3`	`+importjava.util.LinkedHashMap;`
	`4`	`+importjava.util.Map;`
	`5`	`+`
	`6`	`+/**The shortest implementation is to use LinkedHashMap:`
	`7`	`+ * specify a size of the linkedHashMap;`
	`8`	`+ * override the removeEldestEntry method when its size exceeds max size: https://docs.oracle.com/javase/8/docs/api/java/util/LinkedHashMap.html#removeEldestEntry-java.util.Map.Entry-`
	`9`	`+ * in the constructor, set the last boolean variable to be true: it means the ordering mode, if we set it to true, it means`
	`10`	`+ * in access order, false, means it's in insertion order: https://docs.oracle.com/javase/8/docs/api/java/util/LinkedHashMap.html#LinkedHashMap-int-float-boolean-*/`
	`11`	`+publicclassLRUCache_use_LinkedHashMap {`
	`12`	`+`
	`13`	`+privateMap<Integer,Integer>cache;`
	`14`	`+privatefinalintmax;`
	`15`	`+`
	`16`	`+publicLRUCache_use_LinkedHashMap(intcapacity) {`
	`17`	`+max =capacity;`
	`18`	`+cache =newLinkedHashMap<Integer,Integer>(capacity,1.0f,true){`
	`19`	`+publicbooleanremoveEldestEntry(Map.Entryeldest){`
	`20`	`+returncache.size() >max;`
	`21`	`+ }`
	`22`	`+ };`
	`23`	`+ }`
	`24`	`+`
	`25`	`+publicintget(intkey) {`
	`26`	`+returncache.getOrDefault(key, -1);`
	`27`	`+ }`
	`28`	`+`
	`29`	`+publicvoidset(intkey,intvalue) {`
	`30`	`+cache.put(key,value);`
	`31`	`+ }`
	`32`	`+}`

Comments

(0)