<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Lazy-Deletion on</title><link>https://h30306.github.io/blog/zh-tw/tags/lazy-deletion/</link><description>Recent content in Lazy-Deletion 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>Tue, 20 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/lazy-deletion/index.xml" rel="self" type="application/rss+xml"/><item><title>Queue 與設計題</title><link>https://h30306.github.io/blog/zh-tw/algorithm/queue-and-design/</link><pubDate>Tue, 20 Oct 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/algorithm/queue-and-design/</guid><description>環狀佇列、交錯迭代器、FIFO 配對加上取消，以及設計題常用的資料結構組合</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/queue-and-design/featured.png"/></item><item><title>LeetCode 716: Max Stack</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-716/</link><pubDate>Mon, 14 Sep 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-716/</guid><description>LeetCode 716 解題筆記：stack 和 heap 都存唯一 id，刪除只記 id，查詢時再丟掉已刪除的；用值記錄會分不清重複的元素</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-716/featured.png"/></item><item><title>LeetCode 3885: Design Event Manager</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3885/</link><pubDate>Sun, 29 Mar 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3885/</guid><description>LeetCode 3885 解題筆記：dict 存目前優先度，max-heap 加 lazy deletion，彈出時再驗證</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3885/featured.png"/></item><item><title>LeetCode 3829: Design Ride Sharing System</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3829/</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-3829/</guid><description>LeetCode 3829 解題筆記：乘客和司機各一個 queue，取消只記在 set 裡，配對前再把隊頭已取消的乘客丟掉</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3829/featured.png"/></item><item><title>LeetCode 3815: Design Auction System</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3815/</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-3815/</guid><description>LeetCode 3815 解題筆記：每個商品一個 max-heap，出價改變就推新的一筆，查詢時丟掉過期的</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3815/featured.png"/></item><item><title>LeetCode 3607: Power Grid Maintenance</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3607/</link><pubDate>Sun, 06 Jul 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3607/</guid><description>LeetCode 3607 解題筆記：Union-Find 分群，每群一個 min-heap，離線的站用 lazy deletion</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-3607/featured.png"/></item></channel></rss>