题目
思路
dp,不断更新数组的状态。
代码
class Solution:
"""
@param: A: A list of integers
@return: A boolean
"""
def canJump(self, A):
# write your code here
dp = [False for i in range(len(A))]
dp[0] = True
for i in range(len(A)):
if dp[i]:
for j in range(i, len(A)):
if j <= i + A[i] and j < len(A): dp[j] = True
return dp[len(A) - 1]