【45】跳跃游戏 Ⅱ：困难

https://leetcode-cn.com/problems/jump-game-ii/ 数组、贪心算法

贪心算法

function jump(nums: number[]): number {
    let end = 0
    let max = 0
    let steps = 0
    for(let i = 0; i < nums.length - 1; i++) {
        max = Math.max(max, i + nums[i])
        if(i === end) {
            end = max
            steps++
        }
    }
    return steps
};