Jump Game

Q:

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.

Solution:

<pre name="code" class="java">public class Solution {    public boolean canJump(int[] A) {        int index = 0;        while (index < A.length - 1) {            if (index + A[index] >= A.length - 1)                return true;            int lastIndex = index;            int max = 0;            for (int i = 1; (index + i < A.length) && i <= A[index]; i++) {                if (index + i + A[index + i] > max) {                    max = index + i + A[index + i];                    lastIndex = index + i;                }            }            if (index == lastIndex)                return false;            index = lastIndex;        }        return true;    }}