<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>动态规划题解：从入门到精通的状态转移 on PlumePHP</title><link>https://plumephp.com/posts/algorithm-interview/leetcode/dynamic-programming/</link><description>Recent content in 动态规划题解：从入门到精通的状态转移 on PlumePHP</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Fri, 25 Sep 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://plumephp.com/posts/algorithm-interview/leetcode/dynamic-programming/index.xml" rel="self" type="application/rss+xml"/><item><title>动态规划必刷12题：从爬楼梯到股票问题</title><link>https://plumephp.com/leetcode-dynamic-programming-essential-problems/</link><pubDate>Fri, 25 Sep 2026 00:00:00 +0800</pubDate><guid>https://plumephp.com/leetcode-dynamic-programming-essential-problems/</guid><description>精选LeetCode动态规划领域12道必刷题目，覆盖线性DP、状态机DP、背包问题与区间DP四大类型，详解状态定义与转移方程的推导过程。</description></item></channel></rss>