<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>K-Way-Merge on</title><link>https://h30306.github.io/blog/zh-tw/tags/k-way-merge/</link><description>Recent content in K-Way-Merge 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>Sun, 03 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/k-way-merge/index.xml" rel="self" type="application/rss+xml"/><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 632: Smallest Range Covering Elements from K Lists</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-632/</link><pubDate>Sun, 18 Jan 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-632/</guid><description>LeetCode 632 解題筆記：heap 放每條 list 的目前元素，同時記錄最大值，每次推進最小的那條</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-632/featured.png"/></item></channel></rss>