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