class Solution {
public:
bool canJump(int A[], int n) {
int reach=0;
for(int i=0;i<n;i++)
{
if(i<=reach)
{
reach=max(reach,i+A[i]);
}
}
return reach>=n-1;
}
};
class Solution {
public:
bool canJump(int A[], int n) {
int reach=0;
for(int i=0;i<n;i++)
{
if(i<=reach)
{
reach=max(reach,i+A[i]);
}
}
return reach>=n-1;
}
};