<p>You are given an integer array <code>nums</code>. You are initially positioned at the array&#39;s <strong>first index</strong>, and each element in the array represents your maximum jump length at that position.</p>

<p>Return <code>true</code><em> if you can reach the last index, or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [2,3,1,1,4]
<strong>Output:</strong> true
<strong>Explanation:</strong> Jump 1 step from index 0 to 1, then 3 steps to the last index.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,2,1,0,4]
<strong>Output:</strong> false
<strong>Explanation:</strong> You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
</ul>

int speedUp = []
{std::ios::sync_with_stdio(0); std::cin.tie(0); return 0; }();

int digit(char c)
{
    return c & 15;
}
bool isDigit(char c)
{
    return '0' <= c && c <= '9';
}
int init = []
{
    std::ofstream out("user.out");
    std::cout.rdbuf(out.rdbuf());
    for (std::string s; std::getline(std::cin, s); std::cout << '\n')
    {
        int prev = 1;
        bool ans = true;
        for (int _i = 1, _n = s.length(), v; _i < _n; ++_i)
        {
            v = digit(s[_i]);
            while (isDigit(s[++_i]))
                v = v * 10 + digit(s[_i]);
            
            if (prev == 0)
                ans = false;
            else if (v > --prev)
                prev = v;
        }
        std::cout << (ans ? "true" : "false");
    }
    exit(0);
    return 0;
}();

class Solution
{
public:
    bool canJump(std::vector<int> &)
    {
        return true;
    }
};
7600