首页 > 代码库 > dynamic programming
dynamic programming
Dynamic programming, or the "put shit in a table" technique, is an optimization for certain types of recurrence problems (specifically, those with overlapping subproblems). So the first thing I would say is think recursion, don‘t think dynamic programming at first. Once you solve the recurrence, dynamic programming is just an extra step at the end.
To solve recurrences, I like to pretend that I have an oracle that will tell me the answer to every question except for the one I want to know. When thinking about it like that, I find that the recurrence becomes clear much more quickly.
dynamic programming
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。