[Leetcode] [JavaScript] Jump Game

https://leetcode.com/problems/jump-game/

Jump Game

Given an array of non-negative integers, you is initially positioned at the first index of the array.

Each element of the array represents your maximum jump length is at that position.

Determine if you is able to reach the last index.

For example:
A = [2,3,1,1,4] , return true .

A = [3,2,1,0,4] , return false .

The greed of water and water

/** * @param {number[]} Nums * @return {Boolean}*/varCanjump =function(nums) {varHasjump = Nums[0];  for(vari = 1; i < nums.length; i++){        if(hasjump <= 0){            return false; }Else{hasjump--; Hasjump=Math.max (Hasjump, nums[i]); }           }    return true;};

[Leetcode] [JavaScript] Jump Game