145

LeetCode 55 Jump Game从回溯到动态规划 | 记忆碎片

 7 years ago
source link: http://www.wangjialong.cc/2017/09/29/leetcode55/?
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
neoserver,ios ssh client
背景动态规划是一个降低时间的很有效的方法，通常一个可以使用递归从上到下来解决的题目，必定可以转化为动态规划，从下往上计算，并通过设置一个数组存放子问题的解，来降低问题的求解步骤。LeetCode上的第55题可以使用回溯法和动态规划来解决，但回溯法会造成栈溢出，下面讲解我的解题思路。

report

Recommend

About Joyk


Aggregate valuable and interesting links.
Joyk means Joy of geeK