好疲惫呀，感觉做不动了，需要一些鼓励
题目描述
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], returntrue.
A =[3,2,1,0,4], returnfalse.
解题思路
记录节点可达最远位置，最后比较最远位置与最后一节点位置的大小
代码示例
class Solution {
public:
bool canJump(int A[], int n) {
//标记能跳到的最远处
int maxjump = 0;
扫描二维码关注公众号，回复：
2360678 查看本文章
//i <= maxjump表示此时能跳到i处，0<=i<n表示扫描所有能到达的点，在改点处能跳到的最远处。
for (int i = 0; i < n && i <= maxjump; i++) {
maxjump = max(maxjump, i + A[i]);}
//如果最后跳的最远的结果大于等于n-1，那么满足能跳到最后。
}
};