BILINGUAL WORD CARD · RANK 91

dynamic programming

📓 Solving complex problems by storing subproblem results

Optimization method using overlapping subproblems.

中文对照 · Chinese

📓 把算过的子问题答案记在笔记本上绝不重算

通过状态转移方程(如 `dp[i] = dp[i-1] + dp[i-2]`)高效求解。

Code example

dp[i] = min(dp[i-1], dp[i-2]) + cost[i];
Explore 100 bilingual word cards →