feat: add swift implementation to lcp problem: N9 (#3745)

Author: klever34

lcp/LCP 09. 最小跳跃次数/README.md

@@ -178,6 +178,50 @@ func minJump(jump []int) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minJump(_ jump: [Int]) -> Int {
+        let n = jump.count
+        var vis = Array(repeating: false, count: n)
+        var queue = [0]
+        vis[0] = true
+        var ans = 0
+        var maxReach = 1
+        
+        while !queue.isEmpty {
+            ans += 1
+            let size = queue.count
+            
+            for _ in 0..<size {
+                let i = queue.removeFirst()
+                
+                let forwardJump = i + jump[i]
+                if forwardJump >= n {
+                    return ans
+                }
+                
+                if !vis[forwardJump] {
+                    queue.append(forwardJump)
+                    vis[forwardJump] = true
+                }
+                
+                while maxReach < i {
+                    if !vis[maxReach] {
+                        queue.append(maxReach)
+                        vis[maxReach] = true
+                    }
+                    maxReach += 1
+                }
+            }
+        }
+        
+        return -1
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcp/LCP 09. 最小跳跃次数/Solution.swift

@@ -0,0 +1,39 @@
+class Solution {
+    func minJump(_ jump: [Int]) -> Int {
+        let n = jump.count
+        var vis = Array(repeating: false, count: n)
+        var queue = [0]
+        vis[0] = true
+        var ans = 0
+        var maxReach = 1
+        
+        while !queue.isEmpty {
+            ans += 1
+            let size = queue.count
+            
+            for _ in 0..<size {
+                let i = queue.removeFirst()
+
+                let forwardJump = i + jump[i]
+                if forwardJump >= n {
+                    return ans
+                }
+                
+                if !vis[forwardJump] {
+                    queue.append(forwardJump)
+                    vis[forwardJump] = true
+                }
+                
+                while maxReach < i {
+                    if !vis[maxReach] {
+                        queue.append(maxReach)
+                        vis[maxReach] = true
+                    }
+                    maxReach += 1
+                }
+            }
+        }
+        
+        return -1
+    }
+}