Space Optimization in recursive DP?

Правка en1, от I_am_Vengeance, 2020-10-27 10:20:55

Is there any way to space optimize a recursive DP for example say the 0-1 knapsack problem where we can do it iteratively using a 2xN dp array iteratively. Recently I came across this probelem and this problem where I was forced to use an iterative DP. Is there any way to solve these problems recursively?

Теги #dp, #space optimized, #optimization, #recursion


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский I_am_Vengeance 2020-10-27 10:20:55 438 Initial revision (published)