Queue onhttps://h30306.github.io/blog/zh-tw/tags/queue/Recent content in Queue onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000Queue 與設計題https://h30306.github.io/blog/zh-tw/algorithm/queue-and-design/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/algorithm/queue-and-design/環狀佇列、交錯迭代器、FIFO 配對加上取消，以及設計題常用的資料結構組合LeetCode 622: Design Circular Queuehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-622/Mon, 14 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-622/LeetCode 622 解題筆記：固定大小陣列加上 head 和 count，位置都對容量取模，空和滿用 count 判斷LeetCode 1425: Constrained Subsequence Sumhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1425/Thu, 10 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1425/LeetCode 1425 解題筆記：dp[i] = nums[i] + max(0, 前 k 個 dp 的最大值)；前 k 個 dp 的最大值是滑動視窗最大值，用單調佇列 O(1) 取得LeetCode 281: Zigzag Iteratorhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-281/Wed, 29 Apr 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-281/LeetCode 281 解題筆記：queue 裡放還沒用完的來源，輪流取一個，還有剩就放回尾端；可以直接推廣到 k 個LeetCode 3835: Count Subarrays With Cost Less Than or Equal to Khttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3835/Sun, 08 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3835/LeetCode 3835 解題筆記：花費 = (最大 - 最小) × 長度，視窗變大只會變貴，所以可以滑動視窗數子陣列；視窗最大、最小值用兩個單調佇列維護LeetCode 3829: Design Ride Sharing Systemhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3829/Sun, 01 Feb 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3829/LeetCode 3829 解題筆記：乘客和司機各一個 queue，取消只記在 set 裡，配對前再把隊頭已取消的乘客丟掉LeetCode 1696: Jump Game VIhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1696/Sun, 10 Aug 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1696/LeetCode 1696 解題筆記：dp[i] = nums[i] + 前 k 個 dp 的最大值；前 k 個的最大值用單調佇列維護，O(n)LeetCode 3508: Implement Routerhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-3508/Sun, 06 Apr 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-3508/LeetCode 3508 解題筆記：queue 管 FIFO、set 判重複、每個目的地一個遞增的時間陣列，查詢用 bisectLeetCode 387: First Unique Character in a Stringhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-387/Tue, 23 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-387/LeetCode 387 解題筆記：先計數，再從左到右找第一個次數是 1 的字元LeetCode 232: Implement Queue using Stackshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-232/Mon, 22 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-232/LeetCode 232 解題筆記：兩個 stack：in 負責 push，out 空的時候才把 in 全部倒過去，均攤 O(1)LeetCode 225: Implement Stack using Queueshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-225/Sun, 21 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-225/LeetCode 225 解題筆記：一個 queue 就夠：push 之後把前面的元素全部轉到後面，新元素就到了隊首