<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Iterator on</title><link>https://h30306.github.io/blog/zh-tw/tags/iterator/</link><description>Recent content in Iterator 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>Sat, 24 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/iterator/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 173: Binary Search Tree Iterator</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-173/</link><pubDate>Sat, 24 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-173/</guid><description>LeetCode 173 解題筆記：攤平成陣列很直接但用 O(n) 空間；follow-up 用 stack 存左側鏈，均攤 O(1)、空間 O(h)</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-173/featured.png"/></item><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 281: Zigzag Iterator</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-281/</link><pubDate>Wed, 29 Apr 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-281/</guid><description>LeetCode 281 解題筆記：queue 裡放還沒用完的來源，輪流取一個，還有剩就放回尾端；可以直接推廣到 k 個</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-281/featured.png"/></item></channel></rss>