<?xml version="1.0" encoding="utf-8"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"><channel><title>MagicLen</title><link>https://magiclen.org/cn/tag/dynamic-programming/</link><description>多元化原创文章，内容包罗万象，有编程语言、网站应用、软件介绍、硬件介绍、操作系统、旅行游记、专题采访、益智问题、文学创作，以及作者们的知识分享和作品分享。</description><language>zh-CN</language><lastBuildDate>Sun, 22 Nov 2026 18:51:16 +0800</lastBuildDate><atom:link href="https://magiclen.org/cn/tag/dynamic-programming/feed/" rel="self" type="application/rss+xml"/><sy:updatePeriod>hourly</sy:updatePeriod><sy:updateFrequency>8</sy:updateFrequency><sy:updateBase>1970-01-01T00:00+00:00</sy:updateBase><item><title>用动态规划解决问题：零壹背包问题(0/1 Knapsack Problem)</title><link>https://magiclen.org/cn/dynamic-programming-0-1-knapsack-problem/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
一个背着背包的小偷闯空门偷东西，他必须趁屋主回来之前把有价值的物品塞进包包内带走。考虑到小偷自身的行动力，背包能装的物品总重量有限，小偷要如何选择物品才能获得最高的总价值？]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-0-1-knapsack-problem</guid><pubDate>Tue, 4 Aug 2020 12:00:41 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>用动态规划解决问题：找零钱问题(Coin Change Problem)</title><link>https://magiclen.org/cn/dynamic-programming-coin-change/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
许多人认为身上如果带太多的零钱会让行动变得不方便，因此会希望商店店员在找零钱的时候能够以最少的硬币数来找，而不是全部都用 1 元塞给我们。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-coin-change</guid><pubDate>Tue, 28 Jul 2020 12:00:30 +0800</pubDate><dc:creator>Magic Len</dc:creator></item><item><title>用动态规划解决问题：基本观念（有重叠子问题的问题）</title><link>https://magiclen.org/cn/dynamic-programming-basic/</link><description><![CDATA[<img src="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg" srcset="https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-220x162.jpg 1x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-440x324.jpg 2x, https://magiclen.org/wp-content/uploads/2020/04/technology-1283624_1920-660x486.jpg 3x" alt>
动态规划（Dynamic Programming，简称 DP）是一种解决问题的技巧，主要被用来优化那些「记不住自己过去曾解出来的答案所以只好重复再解」的算法，让它们可以「记忆」已经找出来的答案，从而不断利用，以大大降低时间复杂度（从指数级降到线性）。]]></description><category>研究分享</category><category>Go</category><category>Java</category><category>Rust</category><category>算法</category><category>JavaScript</category><category>Java</category><category>JavaScript</category><category>Rust</category><category>TypeScript</category><category>费氏数列</category><category>动态规划</category><category>Go</category><guid>https://magiclen.org/cn/dynamic-programming-basic</guid><pubDate>Tue, 21 Jul 2020 12:00:16 +0800</pubDate><dc:creator>Magic Len</dc:creator></item></channel></rss>