Swift implementation for LCOF 52

Author: klever34

lcof/面试题52. 两个链表的第一个公共节点/README.md

@@ -253,6 +253,34 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+/* public class ListNode {
+*     public var val: Int
+*     public var next: ListNode?
+*     public init(_ val: Int) {
+*         self.val = val
+*         self.next = nil
+*     }
+* }
+*/
+
+class Solution {
+    func getIntersectionNode(_ headA: ListNode?, _ headB: ListNode?) -> ListNode? {
+        var a = headA
+        var b = headB
+        
+        while a !== b {
+            a = a == nil ? headB : a?.next
+            b = b == nil ? headA : b?.next
+        }
+        
+        return a
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof/面试题52. 两个链表的第一个公共节点/Solution.swift

@@ -0,0 +1,23 @@
+/* public class ListNode {
+*     public var val: Int
+*     public var next: ListNode?
+*     public init(_ val: Int) {
+*         self.val = val
+*         self.next = nil
+*     }
+* }
+*/
+
+class Solution {
+    func getIntersectionNode(_ headA: ListNode?, _ headB: ListNode?) -> ListNode? {
+        var a = headA
+        var b = headB
+        
+        while a !== b {
+            a = a == nil ? headB : a?.next
+            b = b == nil ? headA : b?.next
+        }
+        
+        return a
+    }
+}