LRU Cache: How would you design an LRU cache with O(1) get and put?

LRU Cache: How would you design an LRU cache with O(1) get and put?

题目类型: 技术面试题

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

难度: hard

标签: interviewbit, python, topic-specific

参考答案摘要

You use a dictionary for fast lookup and a doubly linked list (or OrderedDict) to track recent usage, when you access an item you move it to the end, when cache is full you remove the least recently u...

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