JAVA 知识体系-LRU实现

randian666 · randian666 · commit d289dadefc43 · 2018-12-19T14:22:45.000+08:00
diff --git a/src/main/java/com/algorithm/study/demo/LRUCache/LRULinkedMap.java b/src/main/java/com/algorithm/study/demo/LRUCache/LRULinkedMap.java
@@ -45,6 +45,7 @@ public static void main(String[] args) {
         map.put("2",2);
         map.put("3",3);
         map.put("4",4);
+        System.out.println(map.get("1"));
         map.put("5",5);
         for (Map.Entry<String, Integer> e : map.getAll()){
             System.out.print(e.getKey() + " : " + e.getValue() + "\t");
diff --git a/src/main/java/com/algorithm/study/demo/LRUCache/LRUMap.java b/src/main/java/com/algorithm/study/demo/LRUCache/LRUMap.java
@@ -74,12 +74,10 @@ private void moveToHead(Node<K,V> node){
      * @return
      */
     private Node<K,V> getNode(K key){
-        Node<K,V> node = header ;
-        while (node != null){
+        for (Node<K,V> node = header;node!=null;node=node.next){
             if (node.getKey().equals(key)){
                 return node ;
             }
-            node = node.next ;
         }
         return null ;
     }
@@ -147,14 +145,12 @@ public void setValue(V value) {
     @Override
     public String toString() {
         StringBuilder sb = new StringBuilder() ;
-        Node<K,V> node = header ;
-        while (node != null){
+        for (Node<K,V> node = header;node!=null;node=node.next){
             if (node.getKey()!=null){
                 sb.append(node.getKey()).append(":")
                         .append(node.getValue())
                         .append("-->");
             }
-            node = node.next ;
         }
         return sb.toString();
     }

Original file line number	Diff line number	Diff line change
`@@ -74,12 +74,10 @@ private void moveToHead(Node<K,V> node){`
`74`	`74`	`* @return`
`75`	`75`	`*/`
`76`	`76`	`private Node<K,V> getNode(K key){`
`77`		`- Node<K,V> node = header ;`
`78`		`- while (node != null){`
	`77`	`+ for (Node<K,V> node = header;node!=null;node=node.next){`
`79`	`78`	`if (node.getKey().equals(key)){`
`80`	`79`	`return node ;`
`81`	`80`	`}`
`82`		`- node = node.next ;`
`83`	`81`	`}`
`84`	`82`	`return null ;`
`85`	`83`	`}`
`@@ -147,14 +145,12 @@ public void setValue(V value) {`
`147`	`145`	`@Override`
`148`	`146`	`public String toString() {`
`149`	`147`	`StringBuilder sb = new StringBuilder() ;`
`150`		`- Node<K,V> node = header ;`
`151`		`- while (node != null){`
	`148`	`+ for (Node<K,V> node = header;node!=null;node=node.next){`
`152`	`149`	`if (node.getKey()!=null){`
`153`	`150`	`sb.append(node.getKey()).append(":")`
`154`	`151`	`.append(node.getValue())`
`155`	`152`	`.append("-->");`
`156`	`153`	`}`
`157`		`- node = node.next ;`
`158`	`154`	`}`
`159`	`155`	`return sb.toString();`
`160`	`156`	`}`