feat: add swift implementation to lcof2 problem: No.083 (#3468)

Author: klever34

lcof2/剑指 Offer II 083. 没有重复元素集合的全排列/README.md

@@ -247,6 +247,38 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func permute(_ nums: [Int]) -> [[Int]] {
+        var res = [[Int]]()
+        var path = [Int]()
+        var used = [Bool](repeating: false, count: nums.count)
+        dfs(0, nums.count, nums, &used, &path, &res)
+        return res
+    }
+
+    private func dfs(
+        _ u: Int, _ n: Int, _ nums: [Int], _ used: inout [Bool], _ path: inout [Int], _ res: inout [[Int]]
+    ) {
+        if u == n {
+            res.append(path)
+            return
+        }
+        for i in 0..<n {
+            if !used[i] {
+                path.append(nums[i])
+                used[i] = true
+                dfs(u + 1, n, nums, &used, &path, &res)
+                used[i] = false
+                path.removeLast()
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 083. 没有重复元素集合的全排列/Solution.swift

@@ -0,0 +1,27 @@
+class Solution {
+    func permute(_ nums: [Int]) -> [[Int]] {
+        var res = [[Int]]()
+        var path = [Int]()
+        var used = [Bool](repeating: false, count: nums.count)
+        dfs(0, nums.count, nums, &used, &path, &res)
+        return res
+    }
+
+    private func dfs(
+        _ u: Int, _ n: Int, _ nums: [Int], _ used: inout [Bool], _ path: inout [Int], _ res: inout [[Int]]
+    ) {
+        if u == n {
+            res.append(path)
+            return
+        }
+        for i in 0..<n {
+            if !used[i] {
+                path.append(nums[i])
+                used[i] = true
+                dfs(u + 1, n, nums, &used, &path, &res)
+                used[i] = false
+                path.removeLast()
+            }
+        }
+    }
+}