<?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 Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/%E8%BE%85%E5%8A%A9%E6%A0%88/</link><description>Recent content in 辅助栈 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Fri, 21 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E8%BE%85%E5%8A%A9%E6%A0%88/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 155：最小栈，如何让最小值跟着栈一起变化</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/155-min-stack/</link><pubDate>Fri, 21 Aug 2026 00:00:00 +0000</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/155-min-stack/</guid><description>从弹出当前最小值后必须恢复历史最小值的压力出发，逐步构建 LeetCode 155 Min Stack。</description></item></channel></rss>