<?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/%E5%89%8D%E5%90%8E%E6%9C%80%E5%A4%A7%E5%80%BC/</link><description>Recent content in 前后最大值 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Sat, 24 Jan 2026 10:27:35 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%89%8D%E5%90%8E%E6%9C%80%E5%A4%A7%E5%80%BC/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 42：一张高度图能接住多少雨水？</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/42-trapping-rain-water/</link><pubDate>Sat, 24 Jan 2026 10:27:35 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/42-trapping-rain-water/</guid><description>从单个位置出发，推导边界数组和 O(1) 空间的双指针解法，再把同一个边界模型迁移到单调栈。</description></item></channel></rss>