feat: add swift implementation to lcci problems: No.01.08,01.09,02.01 (doocs#2604)

Author: klever34

lcci/01.08.Zero Matrix/README.md

@@ -252,6 +252,35 @@ void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
 }
 ```
 
+```swift
+class Solution {
+    func setZeroes(_ matrix: inout [[Int]]) {
+        let m = matrix.count
+        guard m > 0 else { return }
+        let n = matrix[0].count
+        var rows = Array(repeating: false, count: m)
+        var cols = Array(repeating: false, count: n)
+
+        for i in 0..<m {
+            for j in 0..<n {
+                if matrix[i][j] == 0 {
+                    rows[i] = true
+                    cols[j] = true
+                }
+            }
+        }
+
+        for i in 0..<m {
+            for j in 0..<n {
+                if rows[i] || cols[j] {
+                    matrix[i][j] = 0
+                }
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### 方法二：原地标记

lcci/01.08.Zero Matrix/README_EN.md

@@ -279,6 +279,35 @@ void setZeroes(int** matrix, int matrixSize, int* matrixColSize) {
 }
 ```
 
+```swift
+class Solution {
+    func setZeroes(_ matrix: inout [[Int]]) {
+        let m = matrix.count
+        guard m > 0 else { return }
+        let n = matrix[0].count
+        var rows = Array(repeating: false, count: m)
+        var cols = Array(repeating: false, count: n)
+
+        for i in 0..<m {
+            for j in 0..<n {
+                if matrix[i][j] == 0 {
+                    rows[i] = true
+                    cols[j] = true
+                }
+            }
+        }
+
+        for i in 0..<m {
+            for j in 0..<n {
+                if rows[i] || cols[j] {
+                    matrix[i][j] = 0
+                }
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### Solution 2: In-place Marking

lcci/01.08.Zero Matrix/Solution.swift

@@ -0,0 +1,26 @@
+class Solution {
+    func setZeroes(_ matrix: inout [[Int]]) {
+        let m = matrix.count
+        guard m > 0 else { return }
+        let n = matrix[0].count
+        var rows = Array(repeating: false, count: m)
+        var cols = Array(repeating: false, count: n)
+        
+        for i in 0..<m {
+            for j in 0..<n {
+                if matrix[i][j] == 0 {
+                    rows[i] = true
+                    cols[j] = true
+                }
+            }
+        }
+        
+        for i in 0..<m {
+            for j in 0..<n {
+                if rows[i] || cols[j] {
+                    matrix[i][j] = 0
+                }
+            }
+        }
+    }
+}

lcci/01.09.String Rotation/README.md

@@ -102,6 +102,14 @@ impl Solution {
 }
 ```
 
+```swift
+class Solution {
+    func isFlippedString(_ s1: String, _ s2: String) -> Bool {
+        return (s1.isEmpty && s2.isEmpty) || (s1.count == s2.count && (s1 + s1).contains(s2))
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.09.String Rotation/README_EN.md

@@ -102,6 +102,14 @@ impl Solution {
 }
 ```
 
+```swift
+class Solution {
+    func isFlippedString(_ s1: String, _ s2: String) -> Bool {
+        return (s1.isEmpty && s2.isEmpty) || (s1.count == s2.count && (s1 + s1).contains(s2))
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.09.String Rotation/Solution.swift

@@ -0,0 +1,5 @@
+class Solution {
+    func isFlippedString(_ s1: String, _ s2: String) -> Bool {
+        return (s1.isEmpty && s2.isEmpty) || (s1.count == s2.count && (s1 + s1).contains(s2))
+    }
+}

lcci/02.01.Remove Duplicate Node/README.md

@@ -238,6 +238,38 @@ var removeDuplicateNodes = function (head) {
 };
 ```
 
+```swift
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *   var val: Int
+ *   var next: ListNode?
+ *   init(_ x: Int, _ next: ListNode? = nil) {
+ *       self.val = x
+ *       self.next = next
+ *   }
+ * }
+*/
+
+class Solution {
+    func removeDuplicateNodes(_ head: ListNode?) -> ListNode? {
+        var vis = Set<Int>()
+        let pre = ListNode(0, head)
+        var current: ListNode? = pre
+
+        while current?.next != nil {
+            if vis.insert(current!.next!.val).inserted {
+                current = current?.next
+            } else {
+                current?.next = current?.next?.next
+            }
+        }
+
+        return head
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/02.01.Remove Duplicate Node/README_EN.md

@@ -243,6 +243,38 @@ var removeDuplicateNodes = function (head) {
 };
 ```
 
+```swift
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *   var val: Int
+ *   var next: ListNode?
+ *   init(_ x: Int, _ next: ListNode? = nil) {
+ *       self.val = x
+ *       self.next = next
+ *   }
+ * }
+*/
+
+class Solution {
+    func removeDuplicateNodes(_ head: ListNode?) -> ListNode? {
+        var vis = Set<Int>()
+        let pre = ListNode(0, head)
+        var current: ListNode? = pre
+
+        while current?.next != nil {
+            if vis.insert(current!.next!.val).inserted {
+                current = current?.next
+            } else {
+                current?.next = current?.next?.next
+            }
+        }
+
+        return head
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/02.01.Remove Duplicate Node/Solution.swift

@@ -0,0 +1,29 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *   var val: Int
+ *   var next: ListNode?
+ *   init(_ x: Int, _ next: ListNode? = nil) {
+ *       self.val = x
+ *       self.next = next
+ *   }
+ * }
+*/
+
+class Solution {
+    func removeDuplicateNodes(_ head: ListNode?) -> ListNode? {
+        var vis = Set<Int>()
+        let pre = ListNode(0, head)
+        var current: ListNode? = pre
+        
+        while current?.next != nil {
+            if vis.insert(current!.next!.val).inserted {
+                current = current?.next
+            } else {
+                current?.next = current?.next?.next
+            }
+        }
+        
+        return head
+    }
+}