
  <rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
    <channel>
      <title>阿森毛不多</title>
      <link>https://www.imassen.com/blog</link>
      <description></description>
      <language>zh-cn</language>
      <managingEditor>hansenz42@outlook.com (浩森Hansen)</managingEditor>
      <webMaster>hansenz42@outlook.com (浩森Hansen)</webMaster>
      <lastBuildDate>Sat, 16 Dec 2023 12:32:25 GMT</lastBuildDate>
      <atom:link href="https://www.imassen.com/tags/算法/feed.xml" rel="self" type="application/rss+xml"/>
      
  <item>
    <guid>https://www.imassen.com/blog/2023-12-16-dynamic-programming</guid>
    <title>递归，递推和动态规划</title>
    <link>https://www.imassen.com/blog/2023-12-16-dynamic-programming</link>
    <description>动态规划算法是计算机领域中的一个基本算法，因为抽象和不直观，所以难以理解，我希望用“自上而下”和“递归”这两个计算机的思想带你重新理解动态规划算法。</description>
    <pubDate>Sat, 16 Dec 2023 12:32:25 GMT</pubDate>
    <author>hansenz42@outlook.com (浩森Hansen)</author>
    <category>算法</category>
  </item>

    </channel>
  </rss>
