feat: add swift implementation to lcof problem: No.35

lcof/面试题35. 复杂链表的复制/README.md

@@ -289,6 +289,58 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+/* public class Node: Hashable {
+*     public var val: Int
+*     public var next: Node?
+*     public var random: Node?
+
+*     public init(_ val: Int) {
+*         self.val = val
+*         self.next = nil
+*         self.random = nil
+*     }
+
+*     public static func == (lhs: Node, rhs: Node) -> Bool {
+*         return lhs === rhs
+*     }
+
+*     public func hash(into hasher: inout Hasher) {
+*         hasher.combine(ObjectIdentifier(self))
+*     }
+* }
+*/
+
+class Solution {
+    func copyRandomList(_ head: Node?) -> Node? {
+        var d = [Node: Node]()
+        let dummy = Node(0)
+        var tail: Node? = dummy
+        var cur = head
+
+        while cur != nil {
+            tail?.next = Node(cur!.val)
+            tail = tail?.next
+            d[cur!] = tail
+            cur = cur?.next
+        }
+
+        tail = dummy.next
+        cur = head
+
+        while cur != nil {
+            tail?.random = d[cur!.random ?? Node(0)]
+            tail = tail?.next
+            cur = cur?.next
+        }
+
+        return dummy.next
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof/面试题35. 复杂链表的复制/Solution.swift

@@ -0,0 +1,47 @@
+/* public class Node: Hashable {
+*     public var val: Int
+*     public var next: Node?
+*     public var random: Node?
+
+*     public init(_ val: Int) {
+*         self.val = val
+*         self.next = nil
+*         self.random = nil
+*     }
+
+*     public static func == (lhs: Node, rhs: Node) -> Bool {
+*         return lhs === rhs
+*     }
+
+*     public func hash(into hasher: inout Hasher) {
+*         hasher.combine(ObjectIdentifier(self))
+*     }
+* }
+*/
+
+class Solution {
+    func copyRandomList(_ head: Node?) -> Node? {
+        var d = [Node: Node]()
+        let dummy = Node(0)
+        var tail: Node? = dummy
+        var cur = head
+
+        while cur != nil {
+            tail?.next = Node(cur!.val)
+            tail = tail?.next
+            d[cur!] = tail
+            cur = cur?.next
+        }
+
+        tail = dummy.next
+        cur = head
+
+        while cur != nil {
+            tail?.random = d[cur!.random ?? Node(0)]
+            tail = tail?.next
+            cur = cur?.next
+        }
+
+        return dummy.next
+    }
+}