<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Divide and Conquer on r809&#39;s Notes</title>
    <link>https://r809.tw/tags/divide-and-conquer/</link>
    <description>Recent content in Divide and Conquer on r809&#39;s Notes</description>
    <generator>Hugo</generator>
    <language>zh-tw</language>
    <lastBuildDate>Sat, 02 May 2020 23:34:53 +0800</lastBuildDate>
    <atom:link href="https://r809.tw/tags/divide-and-conquer/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Leetcode 322 找零錢</title>
      <link>https://r809.tw/posts/leetcode-322/</link>
      <pubDate>Sat, 02 May 2020 20:03:10 +0800</pubDate>
      <guid>https://r809.tw/posts/leetcode-322/</guid>
      <description></description>
    </item>
    <item>
      <title>最大子陣列問題</title>
      <link>https://r809.tw/wiki/maximum-subarray/</link>
      <pubDate>Tue, 14 Apr 2020 22:36:34 +0800</pubDate>
      <guid>https://r809.tw/wiki/maximum-subarray/</guid>
      <description></description>
    </item>
    <item>
      <title>Leetcode刷題筆記5</title>
      <link>https://r809.tw/posts/leetcode-practice-5/</link>
      <pubDate>Thu, 15 Aug 2019 20:28:33 +0800</pubDate>
      <guid>https://r809.tw/posts/leetcode-practice-5/</guid>
      <description>&lt;p&gt;刷leetcode簡單的題目，參考之前用過的手法與學新的手法，如前綴和。&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
