[Swift]LeetCode45. 跳跃游戏 II | Jump Game II

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/9907513.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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.

Your goal is to reach the last index in the minimum number of jumps.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
    Jump 1 step from index 0 to 1, then 3 steps to the last index.

Note:

You can assume that you can always reach the last index.

---

给定一个非负整数数组，你最初位于数组的第一个位置。

数组中的每个元素代表你在该位置可以跳跃的最大长度。

你的目标是使用最少的跳跃次数到达数组的最后一个位置。

示例:

2
1
3

说明:

假设你总是可以到达数组的最后一个位置。

---

16ms

class Solution {
    func jump(_ nums: [Int]) -> Int {
  if (nums.count == 0 || nums.count == 1) { return 0 }
  
  var res = 0
  var mi = 0
  for e in 0...nums.count-1 {
    if nums[e] == 0 {continue}
    var md = 0

    if e < mi {continue}
    // print(e,mi)
    for c in e+1...e + nums[e] {
      if (c >= nums.count-1) { return res + 1}
      if (c+nums[c] > md) {mi = c}
      md = max(md,c+nums[c])
      
    }
    res += 1
  }
  return res
}
}

---

80ms

class Solution {
    func jump(_ nums: [Int]) -> Int {

        var startIndex = 0
        var endIndex = 0
        var jump = 0
        var mostFurther = 0
        for i in 0..<nums.count-1{
            mostFurther = max(mostFurther, i + nums[i])
            
            if i == endIndex{
                jump += 1
                endIndex = mostFurther
            }
            
        }
        return jump
    }
}

---

96ms

class Solution {
    func jump(_ nums: [Int]) -> Int {
        var cnt = 0, idx = 0
        var cur = 0, pre = 0
        while cur < nums.count - 1 {
            cnt += 1
            pre = cur
            while idx <= pre {
                cur = max(cur, idx + nums[idx])
                idx += 1
            }
        }
        return cnt
    }
}