feat: add swift implementation to lcci problem: No.08.06 (doocs#2688)

Author: klever34

lcci/08.06.Hanota/README.md

@@ -126,6 +126,24 @@ function hanota(A: number[], B: number[], C: number[]): void {
 }
 ```
 
+```swift
+class Solution {
+    func hanota(_ A: inout [Int], _ B: inout [Int], _ C: inout [Int]) {
+        dfs(n: A.count, a: &A, b: &B, c: &C)
+    }
+
+    private func dfs(n: Int, a: inout [Int], b: inout [Int], c: inout [Int]) {
+        if n == 1 {
+            c.append(a.removeLast())
+            return
+        }
+        dfs(n: n - 1, a: &a, b: &c, c: &b)
+        c.append(a.removeLast())
+        dfs(n: n - 1, a: &b, b: &a, c: &c)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### 方法二：迭代（栈）

lcci/08.06.Hanota/README_EN.md

@@ -131,6 +131,24 @@ function hanota(A: number[], B: number[], C: number[]): void {
 }
 ```
 
+```swift
+class Solution {
+    func hanota(_ A: inout [Int], _ B: inout [Int], _ C: inout [Int]) {
+        dfs(n: A.count, a: &A, b: &B, c: &C)
+    }
+
+    private func dfs(n: Int, a: inout [Int], b: inout [Int], c: inout [Int]) {
+        if n == 1 {
+            c.append(a.removeLast())
+            return
+        }
+        dfs(n: n - 1, a: &a, b: &c, c: &b)
+        c.append(a.removeLast())
+        dfs(n: n - 1, a: &b, b: &a, c: &c)
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### Solution 2: Iteration (Stack)

lcci/08.06.Hanota/Solution.swift

@@ -0,0 +1,15 @@
+class Solution {
+    func hanota(_ A: inout [Int], _ B: inout [Int], _ C: inout [Int]) {
+        dfs(n: A.count, a: &A, b: &B, c: &C)
+    }
+
+    private func dfs(n: Int, a: inout [Int], b: inout [Int], c: inout [Int]) {
+        if n == 1 {
+            c.append(a.removeLast())
+            return
+        }
+        dfs(n: n - 1, a: &a, b: &c, c: &b)
+        c.append(a.removeLast())
+        dfs(n: n - 1, a: &b, b: &a, c: &c)
+    }
+}