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
.
class Solution {
public:
bool canJumpInternal(int A[], int n, int tryingPos)
{
if (tryingPos >= n-1)
return true;
//current position value
int val = A[tryingPos];
if (val == 0)
{
return false;
}
//greedy algorithm
int maxJumPos = tryingPos;
for (int i=1; i<=val; i++)
{
int nextJumPos = tryingPos+i+A[tryingPos+i];
// here we try to get the maxJumpPos from current position
if (nextJumPos<n && nextJumPos>maxJumPos)
{
maxJumPos = nextJumPos;
}
else if (nextJumPos >= n-1)
{
return true;
}
}
if (maxJumPos == tryingPos)
return false;
return canJumpInternal(A, n, maxJumPos);
}
bool canJump(int A[], int n) {
if (A == NULL || n == 0)
return false;
if (n == 1)
return true;
//recursive: this is the key point of this solution
return canJumpInternal(A, n, 0);
}
};