<?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%BE%AA%E7%8E%AF%E6%95%B0%E7%BB%84/</link><description>Recent content in 循环数组 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Mon, 20 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/%E5%BE%AA%E7%8E%AF%E6%95%B0%E7%BB%84/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 503：下一个更大元素 II，循环数组中的右侧到哪里结束</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/503-next-greater-element-ii/</link><pubDate>Mon, 20 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/503-next-greater-element-ii/</guid><description>从循环数组的严格下一个更大元素定义出发，先写可验证的环形扫描，再推导只压入一次原始索引的线性单调栈解法。</description></item></channel></rss>