<?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/%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/</link>
    <description>Recent content in 下一个更大元素 on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 20:11:10 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>单调栈算法:如何用O(n)时间找到下一个更大元素</title>
      <link>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E6%A0%88%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8on%E6%97%B6%E9%97%B4%E6%89%BE%E5%88%B0%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/</link>
      <pubDate>Sun, 08 Mar 2026 20:11:10 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%8D%95%E8%B0%83%E6%A0%88%E7%AE%97%E6%B3%95%E5%A6%82%E4%BD%95%E7%94%A8on%E6%97%B6%E9%97%B4%E6%89%BE%E5%88%B0%E4%B8%8B%E4%B8%80%E4%B8%AA%E6%9B%B4%E5%A4%A7%E5%85%83%E7%B4%A0/</guid>
      <description>一篇系统讲解单调栈算法的深度教程，从核心原理到四种类型（单调递增/递减栈），结合LeetCode经典题目（496/503/739/42/84/402/316等）的完整Java实现与复杂度分析，帮助你彻底掌握这一面试高频算法模式。</description>
    </item>
  </channel>
</rss>
