René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/lru-cache","name":"#146 - LRU Cache - LeetCode JavaScript Solutions","description":"Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capac...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number} capacity\n */\nvar LRUCache = function(capacity) {\n this.cache = new Map();\n this.capacity = capacity;\n};\n\n/**\n * @param {number} key\n * @return {number}\n */\nLRUCache.prototype.get = function(key) {\n if (!this.cache.has(key)) {\n return -1;\n }\n\n const value = this.cache.get(key);\n this.cache.delete(key);\n this.cache.set(key, value);\n return this.cache.get(key);\n};\n\n/**\n * @param {number} key\n * @param {number} value\n * @return {void}\n */\nLRUCache.prototype.put = function(key, value) {\n if (this.cache.has(key)) {\n this.cache.delete(key);\n }\n this.cache.set(key, value);\n if (this.cache.size > this.capacity) {\n this.cache.delete(this.cache.keys().next().value);\n }\n};","keywords":"LeetCode 146, #146 - LRU Cache, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}