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.

class Solution {
public:
    bool canJump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int idx = 0;
        while(A[idx] != 0 && idx < n - 1){
            idx += A[idx];
        }
        if(idx >= n-1){
            return true;
        }
        else{
            return false;
        }
    }
};

上面的解法是错的。应该是下面这种。

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