class Solution {
public:
bool canJump(int A[], int n) {
int count = 0;
for( int i = 0 ; i < n-1 ; ) {
int m = INT_MIN;
int mi = i;
int jumpsize = A[i];
for( int j = 0 ; j < jumpsize; j++ ) {
if( i + j + 1 < n-1 && i + j + 1 + A[i+j+1] > m ) {
m = i + j + 1 + A[i+j+1];
mi = i + j + 1;
}
if( i + j + 1 >= n-1 ) {
return true;
}
}
if( m == INT_MIN ) {
return false;
}
else {
i = mi;
}
}
return true;
}
};
System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
1000+ learners
Details →Redis Internals
Learn internals of Redis by re-implementing some of the core features in Golang.
28+ learners
Details →