feat: update swift solutions to lc problem: No.01.06、No.01.07 (#2589)

* Swift implementation for 01.06 & 01.07

Signed-off-by: Lanre Adedara

* style: format code and docs with prettier

---------

Signed-off-by: Lanre Adedara
Co-authored-by: klever34 <klever34@users.noreply.github.com>

Author: klever34

lcci/01.06.Compress String/README.md

@@ -167,6 +167,28 @@ var compressString = function (S) {
 };
 ```
 
+```swift
+class Solution {
+    func compressString(_ S: String) -> String {
+        let n = S.count
+        var compressed = ""
+        var i = 0
+
+        while i < n {
+            var j = i
+            let currentChar = S[S.index(S.startIndex, offsetBy: i)]
+            while j < n && S[S.index(S.startIndex, offsetBy: j)] == currentChar {
+                j += 1
+            }
+            compressed += "\(currentChar)\(j - i)"
+            i = j
+        }
+
+        return compressed.count < n ? compressed : S
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.06.Compress String/README_EN.md

@@ -173,6 +173,28 @@ var compressString = function (S) {
 };
 ```
 
+```swift
+class Solution {
+    func compressString(_ S: String) -> String {
+        let n = S.count
+        var compressed = ""
+        var i = 0
+
+        while i < n {
+            var j = i
+            let currentChar = S[S.index(S.startIndex, offsetBy: i)]
+            while j < n && S[S.index(S.startIndex, offsetBy: j)] == currentChar {
+                j += 1
+            }
+            compressed += "\(currentChar)\(j - i)"
+            i = j
+        }
+
+        return compressed.count < n ? compressed : S
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.06.Compress String/Solution.swift

@@ -0,0 +1,19 @@
+class Solution {
+    func compressString(_ S: String) -> String {
+        let n = S.count
+        var compressed = ""
+        var i = 0
+        
+        while i < n {
+            var j = i
+            let currentChar = S[S.index(S.startIndex, offsetBy: i)]
+            while j < n && S[S.index(S.startIndex, offsetBy: j)] == currentChar {
+                j += 1
+            }
+            compressed += "\(currentChar)\(j - i)"
+            i = j
+        }
+        
+        return compressed.count < n ? compressed : S
+    }
+}

lcci/01.07.Rotate Matrix/README.md

@@ -203,6 +203,30 @@ public class Solution {
 }
 ```
 
+```swift
+class Solution {
+    func rotate(_ matrix: inout [[Int]]) {
+        let n = matrix.count
+
+        for i in 0..<(n >> 1) {
+            for j in 0..<n {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[n - i - 1][j]
+                matrix[n - i - 1][j] = t
+            }
+        }
+
+        for i in 0..<n {
+            for j in 0..<i {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[j][i]
+                matrix[j][i] = t
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.07.Rotate Matrix/README_EN.md

@@ -232,6 +232,30 @@ public class Solution {
 }
 ```
 
+```swift
+class Solution {
+    func rotate(_ matrix: inout [[Int]]) {
+        let n = matrix.count
+
+        for i in 0..<(n >> 1) {
+            for j in 0..<n {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[n - i - 1][j]
+                matrix[n - i - 1][j] = t
+            }
+        }
+
+        for i in 0..<n {
+            for j in 0..<i {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[j][i]
+                matrix[j][i] = t
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/01.07.Rotate Matrix/Solution.swift

@@ -0,0 +1,21 @@
+class Solution {
+    func rotate(_ matrix: inout [[Int]]) {
+        let n = matrix.count
+
+        for i in 0..<(n >> 1) {
+            for j in 0..<n {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[n - i - 1][j]
+                matrix[n - i - 1][j] = t
+            }
+        }
+
+        for i in 0..<n {
+            for j in 0..<i {
+                let t = matrix[i][j]
+                matrix[i][j] = matrix[j][i]
+                matrix[j][i] = t
+            }
+        }
+    }
+}