Hello,
I went over the algorithm explained in “Dynamic Programming - Optimal Game strategy”.
I tried applying the same concept and recursion equation in this leetcode problem. But I am getting wrong answer for that. Can someone please explain why this recursion does not work here?
Problem - https://leetcode.com/problems/stone-game-vii/
i.e.
return dp[lo][hi] = max(stones[lo] + min(solve(dp, stones, lo+2, hi), solve(dp, stones, lo+1, hi-1)),
stones[hi] + min(solve(dp, stones, lo+1, hi-1), solve(dp, stones, lo, hi-2)));