Jump Game - Leetcode

public class Solution {    public boolean canJump(int[] A) {        int cur=1;        for(int i=0; i<cur&& cur<A.length;i++){            cur = Math.max(i+A[i]+1,cur);        }        return cur>=A.length;    }}

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.

<span style="font-size:10px;">public class Solution {    public boolean canJump(int[] A) {        int[] f= new int[A.length];        f[0]=A[0];        for(int i=1; i<A.length;i++){            f[i]=Math.max(f[i-1],A[i-1])-1;            if(f[i]<0)            return false;        }        return f[A.length-1]>=0;    }}</span>