<?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>LeetCode 452 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-452/</link><description>Recent content in LeetCode 452 on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>zh-cn</language><lastBuildDate>Mon, 06 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-452/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 452：用最少数量的箭引爆气球，从共同交集推出区间贪心</title><link>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/</link><pubDate>Mon, 06 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/</guid><description>从一支箭能覆盖哪些气球出发，推导 LeetCode 452 用最少数量的箭引爆气球：先写共同交集扫描基线，再压缩成按结束位置排序的 arrow_pos 贪心。</description></item></channel></rss>