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

思路：用reach记录可以到达的范围，并不断更新；it记录当前的位置。最后判断it能否到达最后一个位置

class Solution {public:    bool canJump(vector<int>& nums) {        int len = nums.size();        int reach = 0, it = 0;        while(it<len && it<=reach)        {            reach = max(reach,it+nums[it]);            it++;        }        return it==len;    }};