[Leetcode] Jump Game (Java)

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.

看看最远能不能走到终点

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