题目来源:Leetcode Algorithm ProblemSet 55
题目描述:Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example:
A = [2,3,1,1,4]
, return true
.
A = [3,2,1,0,4]
, return false
.
解题思路:用一个值maxReach表示当前所能到达的最远距离,在当前所能到达的每一个下标处,判断它们是否能到达更远的地方,即i+nums[i],最后停止时,判断maxReach是否能到达最后一个下标。
题解代码: