[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.

一维DP

转移方程jump[0] = 0, jump[i] = max(jump[i-1], A[i-1])-1

jump代表可以移动的步数，如果步数<0, return false.

class Solution {public: bool canJump(int A[], int n) { vector<int> jump; jump.push_back(0); int i = 1; while(i < n) { jump.push_back(max(jump[i-1],A[i-1])-1); if(jump[i] < 0) return false; i++; } return true; }};</int>