Is this a DP problem or Greedy problem?


  • 0
    T

    Maybe I'm confused about what's the method type to solve Jump Game. It seems to me if we check each index in the array and then compute the maximal index that can be reached from current index, it's DP. If this is true, is there anyone who knows the greedy algorithm to handle the problem?


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.