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
.
Seen this question in a real interview before?
Yes
No
/DFS: exceed time limitation
//position == A.size() - 1
//i <= position + A[position]
bool canJump(vector<int> &A, int position) {
if (position >= A.size() - 1) {
return true;
}
for(int i = position + 1; i <= position + A[position]; i++) {
if (canJump(A, i)) {
return true;
}
}
return false;
}
//BFS: 18ms
//i = cur;
bool canJump(vector<int> &A, int cur, int max) {
if(cur >= A.size() || cur > max) {
return false;
}
int next_max = 0;
for (int i = cur; i <= max; i++) {
if (next_max < i + A[i]) {
next_max = i + A[i];
}
if (next_max >= A.size() - 1) {
return true;
}
}
return canJump(A, max + 1, next_max);
}
//DP : 9ms
bool canJumpDP(vector<int> &A) {
if (A.size() < 2) {
return true;
}
vector<int> can_jump_array(A.size(), 0);
can_jump_array[0] = 1;
for (int i = 1; i < A.size(); i++) {
for (int j = i - 1; j >= 0; j--) {
if (can_jump_array[j] > 0 && j + A[j] >= i) {
can_jump_array[i] = 1;
break;
}
}
}
return can_jump_array[A.size() - 1] == 1;
}