https://shio-chan-dev.github.io/jeanblog/zh/tags/leetcode-435/Recent content in LeetCode 435 on Jeanphilo BlogHugo -- 0.165.0zh-cnMon, 06 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Mon, 06 Jul 2026 00:00:00 +0800https://shio-chan-dev.github.io/jeanblog/zh/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/从删除哪个区间的选择压力出发，推导 LeetCode 435 无重叠区间：先把最少删除转换成最多保留，再逐步推出按结束位置排序的区间贪心。