【Leetcode】Jump Game (DP)

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里面了。

所以常规的思路应该是 拼命跳，跳到（过）了最后一个元素就返回真，跳到坑（0）里了就出不去了(到达的最大目的地正好是0)。返回假

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

简化版的如下

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