dynamic programming
📓 把算过的子问题答案记在笔记本上绝不重算
通过状态转移方程(如 `dp[i] = dp[i-1] + dp[i-2]`)高效求解。
English
📓 Solving complex problems by storing subproblem results
Optimization method using overlapping subproblems.
代码示例
dp[i] = min(dp[i-1], dp[i-2]) + cost[i];探索 100 张双语词卡 →