[Leetcode] Jump game

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.

从后往前找是0的元素（不包括最后一个元素），然后往前搜索是否能找到能跨越这个零点的元素，如果找不到则返回false，如果能找到则跳到该找到元素的前一个元素继续操作，重复上述步骤。 

public class Solution {    public boolean canJump(int[] A) {        for(int i=A.length-2;i>=0;i--){        if(A[i]==0){        boolean oneStep = false;        for(int j = i-1;j>=0;j--){        if(A[j]+j>i){         oneStep = true;        i = j;        break;        }        }        if(!oneStep) return false;        }        }        return true;    }}

[LeetCode]Jump Game