<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Longest-Increasing-Subsequence on</title><link>https://h30306.github.io/blog/zh-tw/tags/longest-increasing-subsequence/</link><description>Recent content in Longest-Increasing-Subsequence 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>Thu, 17 Nov 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/longest-increasing-subsequence/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 334: Increasing Triplet Subsequence</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-334/</link><pubDate>Thu, 17 Nov 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-334/</guid><description>LeetCode 334 解題筆記：維護目前最小的 first 和「前面有比它小的數」中最小的 second，遇到比 second 大的就找到了</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-334/featured.png"/></item><item><title>LeetCode 944: Delete Columns to Make Sorted</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-944/</link><pubDate>Mon, 26 Sep 2022 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-944/</guid><description>LeetCode 944 解題筆記：用 zip(*strs) 取出每一欄，數有幾欄不是非遞減的</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-944/featured.png"/></item></channel></rss>