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

Jump Game II

solution

reach记录从当前位置可以到达的最远位置

class Solution {public:    bool canJump(vector<int>& nums) {            int n = nums.size();    int i = 0;    for (int reach = 0; i < n && i <= reach; ++i)//i<reach说明i是可以到达的        reach = max(i + nums[i], reach);    return i == n;            }};