文章标题

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.

1. 从左边遍历，依次找到可以遍历到的最大范围
2. 如果这个范围包括最后一项则true，否则false。

class Solution {public:    bool canJump(vector<int>& nums) {        if(nums.size()<=1)            return true;            int flag = 0;        for(int i =0;i<nums.size()-1;i++) {            if(i>flag)            continue;            if(nums[i]+i > flag)            flag = nums[i]+i;            if(flag>=nums.size()-1)            return true;        }        return false;    }};