<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sweep-Line on</title><link>https://h30306.github.io/blog/zh-tw/tags/sweep-line/</link><description>Recent content in Sweep-Line on</description><generator>Hugo -- gohugo.io</generator><language>zh-tw</language><managingEditor>hwork0511@gmail.com (Wei Yi Chung)</managingEditor><webMaster>hwork0511@gmail.com (Wei Yi Chung)</webMaster><copyright>© 2026 Wei Yi Chung</copyright><lastBuildDate>Thu, 15 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/sweep-line/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 253: Meeting Rooms II</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-253/</link><pubDate>Thu, 15 Oct 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-253/</guid><description>LeetCode 253 解題筆記：heap 存進行中會議的結束時間，半開區間要用 &amp;lt;=</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-253/featured.png"/></item><item><title>LeetCode 759: Employee Free Time</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-759/</link><pubDate>Sun, 03 May 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-759/</guid><description>LeetCode 759 解題筆記：用 K 路合併依開始時間掃過所有工作區間，目前最晚結束時間之後的空檔就是共同空閒</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-759/featured.png"/></item><item><title>LeetCode 986: Interval List Intersections</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-986/</link><pubDate>Sun, 01 Feb 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-986/</guid><description>LeetCode 986 解題筆記：兩個指針各指一個區間，交集是 [max(起點), min(終點)]；結束得比較早的那個區間不會再跟別人相交，把它的指針往前</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-986/featured.png"/></item></channel></rss>