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.

S: loop， greedy?

存储目前能达到的最大index并不断更新

    bool canJump(vector<int>& nums) {
        int n = nums.size();
        int reach = 0;
        for (int i = 0; i < n-1 && i <= reach; ++i) {
            reach = max(reach, i + nums[i]);
        }
        return reach >= n - 1;
    }