<?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>Sweep Line on LeetCode 题解笔记</title><link>https://leetcode-solutions-5zk.pages.dev/tags/sweep-line/</link><description>Recent content in Sweep Line on LeetCode 题解笔记</description><generator>Hugo</generator><language>zh-cn</language><copyright>2026 ZenzZwei</copyright><lastBuildDate>Mon, 11 May 2026 12:12:02 +0800</lastBuildDate><atom:link href="https://leetcode-solutions-5zk.pages.dev/tags/sweep-line/index.xml" rel="self" type="application/rss+xml"/><item><title>3454. 分割正方形 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/</link><pubDate>Mon, 27 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/3454-separate-squares-ii/</guid><description>Hard | Array, Binary Search, Segment Tree, Sweep Line</description></item><item><title>1851. 包含每个查询的最小区间</title><link>https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/</link><pubDate>Thu, 23 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/1851-minimum-interval-to-include-each-query/</guid><description>Hard | Array, Binary Search, Sweep Line, Sorting, Heap (Priority Queue)</description></item><item><title>850. 矩形面积 II</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0850-rectangle-area-ii/</guid><description>Hard | Array, Segment Tree, Sweep Line, Ordered Set</description></item><item><title>986. 区间列表的交集</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0986-interval-list-intersections/</link><pubDate>Wed, 22 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0986-interval-list-intersections/</guid><description>Medium | Array, Two Pointers, Sweep Line</description></item><item><title>391. 完美矩形</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/</link><pubDate>Mon, 20 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0391-perfect-rectangle/</guid><description>Hard | Array, Hash Table, Math, Geometry, Sweep Line</description></item><item><title>218. 天际线问题</title><link>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</link><pubDate>Fri, 17 Apr 2026 00:00:00 +0000</pubDate><guid>https://leetcode-solutions-5zk.pages.dev/posts/0218-the-skyline-problem/</guid><description>Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set</description></item></channel></rss>