55. 跳跃游戏

class Solution 
{
public:
    bool canJump(vector& nums)
    {
        int cover = 0;
        
        for(int i = 0; i <= cover; ++i)
        {
            cover = max(cover, nums[i] + i);
            
            if(cover >= nums.size() - 1)
            {
                return true;
            }
        }
        
        return false;
    }
};