feat: LRU 淘汰缓存算法

Author: hefeng6500

exercise/LRU.js

@@ -0,0 +1,19 @@
+import { LinkList, Node } from "../src/code/1.LinkList";
+
+export const generateLinkList = () => {
+  new LinkList();
+};
+export class LRU {
+  constructor(limitSize) {
+    this.limitSize = limitSize;
+    this.linklist = new LinkList();
+  }
+
+  add(element) {
+    this.linklist.insert(element, 0);
+
+    if (this.linklist.size() > this.limitSize) {
+      this.linklist.removeAt(this.linklist.size() - 1);
+    }
+  }
+}

src/index.js

@@ -21,19 +21,25 @@ import { Graph } from "./code/23.Graph.js";
 import { breadthFirstSearch, BFS } from "./code/24.breadth-first-search.js";
 import { bubbleSort } from "./sort/bubble-sort.js";
 import { selectionSort } from "./sort/selection-sort.js";
+import { LRU } from "../exercise/LRU";
 
-const linklist = new LinkList();
 
-linklist.push(5);
-linklist.push(4);
-linklist.push(3);
-linklist.push(2);
-linklist.push(1);
+
+const linklist = new LRU(5);
+
+linklist.add(1);
+linklist.add(2);
+linklist.add(3);
+linklist.add(4);
+linklist.add(5);
+linklist.add(100);
+linklist.add(200);
+linklist.add(300);
 
 // console.log(linklist);
 
 
-console.log(linklist.linklistReverse());
+console.log(linklist);
 
 export {
   LinkList,