https://jeanphilogong.github.io/jeanblog/zh/tags/%E5%8C%BA%E9%97%B4/Recent content in 区间 on Jeanphilo BlogHugo -- 0.168.0zh-cnMon, 06 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Mon, 06 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/从删除哪个区间的选择压力出发，推导 LeetCode 435 无重叠区间：先把最少删除转换成最多保留，再逐步推出按结束位置排序的区间贪心。https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/Mon, 06 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/从一支箭能覆盖哪些气球出发，推导 LeetCode 452 用最少数量的箭引爆气球：先写共同交集扫描基线，再压缩成按结束位置排序的 arrow_pos 贪心。https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/56-merge-intervals/Sat, 24 Jan 2026 11:21:03 +0800https://jeanphilogong.github.io/jeanblog/zh/alg/leetcode/hot100/56-merge-intervals/围绕合并区间（LeetCode 56）讲清排序+线性扫描的核心思路、工程场景与多语言实现。