Algorithms, Dynamic Programming, Data Structures, Computer Science, Leetcode.
programming. A problem can be decomposed into several subproblems, and these subproblems can be solved separately to infer the solution of the big problem. Basic concepts of dynamic programming. A problem that can be solved using dynamic programming must meet three conditions: optimal substructure,