动态规划一定要有Optimal Substructure吗?# JobHunting - 待字闺中
z*j
1 楼
RT, dynamic programming is a method for solving complex problems by
breaking them down into simpler subproblems. It is applicable to problems
exhibiting the properties of overlapping subproblems[1] and optimal
substructure.
重叠子问题很好理解,但是,能够应用于DP解决的问题一定要有optimal substructure
吗?就好比Fibonacci所谓的DP解法,只是用了个memo记录下了之间计算过得结果以避
免子问题的重复计算, 但是貌似看不出有什么最优子结构啊。求指点...
breaking them down into simpler subproblems. It is applicable to problems
exhibiting the properties of overlapping subproblems[1] and optimal
substructure.
重叠子问题很好理解,但是,能够应用于DP解决的问题一定要有optimal substructure
吗?就好比Fibonacci所谓的DP解法,只是用了个memo记录下了之间计算过得结果以避
免子问题的重复计算, 但是貌似看不出有什么最优子结构啊。求指点...