<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Data-Structures on</title><link>https://h30306.github.io/blog/zh-tw/tags/data-structures/</link><description>Recent content in Data-Structures 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, 10 Aug 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/data-structures/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 150: Evaluate Reverse Polish Notation</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-150/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-150/</guid><description>使用堆疊解決逆波蘭表示法求值問題</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-150/featured.png"/></item><item><title>LeetCode 155: Min Stack</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-155/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-155/</guid><description>使用元組方法實現具有 O(1) 最小值檢索的堆疊</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-155/featured.png"/></item><item><title>LeetCode 20: Valid Parentheses</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-20/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-20/</guid><description>使用堆疊解決有效括號問題</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-20/featured.png"/></item><item><title>LeetCode 739: Daily Temperatures</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-739/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-739/</guid><description>使用單調堆疊解決每日溫度問題</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-739/featured.png"/></item><item><title>LeetCode 901: Online Stock Span</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-901/</link><pubDate>Sun, 10 Aug 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-901/</guid><description>使用單調堆疊解決股票價格跨度問題</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-901/featured.png"/></item></channel></rss>