Algoritmler (animasiýa)Brauzeriňizde işleýärBarlanan sene: 1 oktýabr 2026

LRU Cache: animasiýa

LRU Cache: animasiýa. Frontend üçin animasiýaly algoritmler: tertipleme, gözleg, debounce we throttle, event loop, wirtual DOM, keş, trie we ýol gözlegi. Brauzeriňizde çalt, gizlin we ýönekeý.

Ýerliadaty ýagdaýda gizlinÇaltagza bolmak gerek däl

Aşakdaky guralyň düwmeleri we tekstleri heniz iňlis dilinde.

Data structuresTime: O(1) per operationSpace: O(capacity)

Cache sizeOperations (put X / get X)

Cache: oldest → newest

Operation log

empty

Step 1 / 14

An LRU (least recently used) cache keeps at most 3 items. When it is full, the item that has not been used for the longest time is thrown out.

checking
found / in view
ruled out

JavaScript

1class LRUCache {
2  constructor(capacity) { this.cap = capacity; this.map = new Map(); }
3  get(key) {
4    if (!this.map.has(key)) return -1;
5    const value = this.map.get(key);
6    this.map.delete(key);
7    this.map.set(key, value);
8    return value;
9  }
10  put(key, value) {
11    this.map.delete(key);
12    this.map.set(key, value);
13    if (this.map.size > this.cap) {
14      this.map.delete(this.map.keys().next().value);
15    }
16  }
17}

Tip: use the arrow keys to step and the space bar to play or pause.

Loading animation...