55、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.

Hide Tags

 Array Greedy

bool canJump(int A[], int n) {       //贪心算法，在一次美团的笔试题目中遇到       int maxP = 0;       for (int i = 0; i < n && i <= maxP & maxP < n - 1; ++i)            maxP = max(maxP, i + A[i]);       if (maxP >= n - 1)            return true;        else             return false;    }