LRU更正

Author: xbox1994

MD/算法-数据结构-LRU淘汰算法.md

@@ -1,41 +1,37 @@
+https://leetcode.com/problems/lru-cache/
+
 LRU，全称Least Recently Used，最近最少使用缓存。
 
 ```java
 import java.util.HashMap;
 import java.util.LinkedList;
 
-public class LRUCache2 {
+class LRUCache {
     private HashMap<Integer, Integer> cacheMap = new HashMap<>();
     private LinkedList<Integer> recentlyList = new LinkedList<>();
     private int capacity;
 
-    public LRUCache2(int capacity) {
+    public LRUCache(int capacity) {
         this.capacity = capacity;
     }
 
-    private int get(int key) {
+    public int get(int key) {
         if (!cacheMap.containsKey(key)) {
             return -1;
         }
-
         recentlyList.remove((Integer) key);
         recentlyList.add(key);
-
         return cacheMap.get(key);
     }
 
-    private void put(int key, int value) {
+    public void put(int key, int value) {
         if (cacheMap.containsKey(key)) {
             recentlyList.remove((Integer) key);
-        }
-
-        if (cacheMap.size() == capacity) {
+        }else if(cacheMap.size() == capacity){
             cacheMap.remove(recentlyList.removeFirst());
         }
-
-        cacheMap.put(key, value);
         recentlyList.add(key);
-
+        cacheMap.put(key, value);
     }
 
     public static void main(String[] args) {

README.md

@@ -49,7 +49,7 @@ PS：除开知识点，一定要准备好以下套路：
 * [数组-滑动窗口-最小连续子数组](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-数组-滑动窗口-最小连续子数组.md)
 * [数组-归并排序-合并有序数组](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-数组-归并排序-合并有序数组.md)
 * [链表-链表反转-链表相加](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-链表-反转链表-链表相加.md)
-* [算法-链表-双指针-删除倒数第n个](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-链表-双指针-删除倒数第n个.md)
+* [链表-双指针-删除倒数第n个](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-链表-双指针-删除倒数第n个.md)
 * [二叉树-二叉树反转](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-二叉树-二叉树反转.md)
 * [动态规划-连续子数组最大和](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-动态规划-连续子数组最大和.md)
 * [数据结构-LRU淘汰算法](https://github.com/xbox1994/2018-Java-Interview/blob/master/MD/算法-数据结构-LRU淘汰算法.md)