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.

This idea actually is from someone else. But it is so neat! In order to reach the end, we only need to calculate the maxStep we can go within current reachable scope....

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