dynamic programming
词源说明
Coined by American mathematician Richard E. Bellman in the 1940s.
释义（英文）
名词 Noun
- (mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.