<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>缓存淘汰策略 on Answer</title>
    <link>https://answer.freetools.me/tags/%E7%BC%93%E5%AD%98%E6%B7%98%E6%B1%B0%E7%AD%96%E7%95%A5/</link>
    <description>Recent content in 缓存淘汰策略 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 21:37:21 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E7%BC%93%E5%AD%98%E6%B7%98%E6%B1%B0%E7%AD%96%E7%95%A5/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>LRU缓存淘汰策略如何用O(1)时间完成get与put操作从双向链表到HashMap的精妙结合</title>
      <link>https://answer.freetools.me/lru%E7%BC%93%E5%AD%98%E6%B7%98%E6%B1%B0%E7%AD%96%E7%95%A5%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%AE%8C%E6%88%90get%E4%B8%8Eput%E6%93%8D%E4%BD%9C%E4%BB%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8%E5%88%B0hashmap%E7%9A%84%E7%B2%BE%E5%A6%99%E7%BB%93%E5%90%88/</link>
      <pubDate>Sun, 08 Mar 2026 21:37:21 +0800</pubDate>
      <guid>https://answer.freetools.me/lru%E7%BC%93%E5%AD%98%E6%B7%98%E6%B1%B0%E7%AD%96%E7%95%A5%E5%A6%82%E4%BD%95%E7%94%A8o1%E6%97%B6%E9%97%B4%E5%AE%8C%E6%88%90get%E4%B8%8Eput%E6%93%8D%E4%BD%9C%E4%BB%8E%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8%E5%88%B0hashmap%E7%9A%84%E7%B2%BE%E5%A6%99%E7%BB%93%E5%90%88/</guid>
      <description>深入解析LRU缓存淘汰算法的核心原理，详细介绍HashMap与双向链表结合实现O(1)操作的精妙设计，包含LeetCode 146 LRU Cache和460 LFU Cache的Java完整解答与面试技巧。</description>
    </item>
  </channel>
</rss>
