Implement an LRU Cache (high level approach + operations)

Implement an LRU Cache (high level approach + operations)

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, javascript, topic-specific, frontend

参考答案摘要

An LRU Cache removes the least recently used item when full. We use a HashMap for O(1) access and a doubly linked list to track usage order. get moves the item to the front. put adds or updates an ite...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。