<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Kadane on</title><link>https://h30306.github.io/blog/zh-tw/tags/kadane/</link><description>Recent content in Kadane 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 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://h30306.github.io/blog/zh-tw/tags/kadane/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 53: Maximum Subarray</title><link>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-53/</link><pubDate>Sun, 10 May 2026 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/leetcode/leetcode-53/</guid><description>LeetCode 53 解題筆記，依照原始 learning note 重新整理</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/leetcode/leetcode-53/featured.png"/></item><item><title>Kadane's Algorithm</title><link>https://h30306.github.io/blog/zh-tw/algorithm/kadanes-algorithm/</link><pubDate>Fri, 25 Jul 2025 00:00:00 +0000</pubDate><author>hwork0511@gmail.com (Wei Yi Chung)</author><guid>https://h30306.github.io/blog/zh-tw/algorithm/kadanes-algorithm/</guid><description>用 ending-here invariant 解 Maximum Subarray</description><media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://h30306.github.io/blog/algorithm/kadanes-algorithm/featured.png"/></item></channel></rss>