feat: add swift implementation to lcci problem: No.10.11 (#2717)

* Swift Implementation for LCCI 10.11

* style: format code and docs with prettier

---------

Co-authored-by: klever34 <klever34@users.noreply.github.com>

Author: klever34

Diff for: lcci/10.11.Peaks and Valleys/README.md

@@ -82,6 +82,22 @@ function wiggleSort(nums: number[]): void {
 }
 ```
 
+```swift
+class Solution {
+    func wiggleSort(_ nums: inout [Int]) {
+        nums.sort()
+
+        let n = nums.count
+
+        for i in stride(from: 0, to: n - 1, by: 2) {
+            let temp = nums[i]
+            nums[i] = nums[i + 1]
+            nums[i + 1] = temp
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

Diff for: lcci/10.11.Peaks and Valleys/README_EN.md

@@ -85,6 +85,22 @@ function wiggleSort(nums: number[]): void {
 }
 ```
 
+```swift
+class Solution {
+    func wiggleSort(_ nums: inout [Int]) {
+        nums.sort()
+
+        let n = nums.count
+
+        for i in stride(from: 0, to: n - 1, by: 2) {
+            let temp = nums[i]
+            nums[i] = nums[i + 1]
+            nums[i + 1] = temp
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

Diff for: lcci/10.11.Peaks and Valleys/Solution.swift

@@ -0,0 +1,13 @@
+class Solution {
+    func wiggleSort(_ nums: inout [Int]) {
+        nums.sort()
+        
+        let n = nums.count
+        
+        for i in stride(from: 0, to: n - 1, by: 2) {
+            let temp = nums[i]
+            nums[i] = nums[i + 1]
+            nums[i + 1] = temp
+        }
+    }
+}