feat: add swift implementation to lcof2 problem: No.027

lcof2/剑指 Offer II 027. 回文链表/README.md

@@ -349,6 +349,55 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     var val: Int
+ *     var next: ListNode?
+ *     init() { self.val = 0; self.next = nil; }
+ *     init(_ val: Int) { self.val = val; self.next = nil; }
+ *     init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
+ * }
+ */
+
+class Solution {
+    func isPalindrome(_ head: ListNode?) -> Bool {
+        guard let head = head else { return true }
+
+        var slow = head
+        var fast = head.next
+        while fast != nil && fast?.next != nil {
+            slow = slow.next!
+            fast = fast?.next?.next
+        }
+
+        var cur = slow.next
+
+        var prev: ListNode? = nil
+        while cur != nil {
+            let nextTemp = cur?.next
+            cur?.next = prev
+            prev = cur
+            cur = nextTemp
+        }
+
+        var left = head
+        var right = prev
+        while right != nil {
+            if left.val != right?.val {
+                return false
+            }
+            left = left.next!
+            right = right?.next
+        }
+        return true
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 027. 回文链表/Solution.swift

@@ -0,0 +1,44 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     var val: Int
+ *     var next: ListNode?
+ *     init() { self.val = 0; self.next = nil; }
+ *     init(_ val: Int) { self.val = val; self.next = nil; }
+ *     init(_ val: Int, _ next: ListNode?) { self.val = val; self.next = next; }
+ * }
+ */
+
+class Solution {
+    func isPalindrome(_ head: ListNode?) -> Bool {
+        guard let head = head else { return true }
+
+        var slow = head
+        var fast = head.next
+        while fast != nil && fast?.next != nil {
+            slow = slow.next!
+            fast = fast?.next?.next
+        }
+
+        var cur = slow.next
+
+        var prev: ListNode? = nil
+        while cur != nil {
+            let nextTemp = cur?.next
+            cur?.next = prev
+            prev = cur
+            cur = nextTemp
+        }
+
+        var left = head
+        var right = prev
+        while right != nil {
+            if left.val != right?.val {
+                return false
+            }
+            left = left.next!
+            right = right?.next
+        }
+        return true
+    }
+}