Swift Implementation for LCCI 17.13

Author: klever34

lcci/17.13.Re-Space/README.md

@@ -108,6 +108,28 @@ func respace(dictionary []string, sentence string) int {
 }
 ```
 
+```swift
+class Solution {
+    func respace(_ dictionary: [String], _ sentence: String) -> Int {
+        let dict = Set(dictionary)
+        let n = sentence.count
+        var dp = [Int](repeating: 0, count: n + 1)
+        let sentenceArray = Array(sentence)
+        
+        for i in 1...n {
+            dp[i] = dp[i - 1] + 1
+            for j in 0..<i {
+                let sub = String(sentenceArray[j..<i])
+                if dict.contains(sub) {
+                    dp[i] = min(dp[i], dp[j])
+                }
+            }
+        }
+        return dp[n]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/17.13.Re-Space/README_EN.md

@@ -113,6 +113,28 @@ func respace(dictionary []string, sentence string) int {
 }
 ```
 
+```swift
+class Solution {
+    func respace(_ dictionary: [String], _ sentence: String) -> Int {
+        let dict = Set(dictionary)
+        let n = sentence.count
+        var dp = [Int](repeating: 0, count: n + 1)
+        let sentenceArray = Array(sentence)
+        
+        for i in 1...n {
+            dp[i] = dp[i - 1] + 1
+            for j in 0..<i {
+                let sub = String(sentenceArray[j..<i])
+                if dict.contains(sub) {
+                    dp[i] = min(dp[i], dp[j])
+                }
+            }
+        }
+        return dp[n]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/17.13.Re-Space/Solution.swift

@@ -0,0 +1,19 @@
+class Solution {
+    func respace(_ dictionary: [String], _ sentence: String) -> Int {
+        let dict = Set(dictionary)
+        let n = sentence.count
+        var dp = [Int](repeating: 0, count: n + 1)
+        let sentenceArray = Array(sentence)
+        
+        for i in 1...n {
+            dp[i] = dp[i - 1] + 1
+            for j in 0..<i {
+                let sub = String(sentenceArray[j..<i])
+                if dict.contains(sub) {
+                    dp[i] = min(dp[i], dp[j])
+                }
+            }
+        }
+        return dp[n]
+    }
+}