feat: add swift implementation to lcci problem: No.05.03 (doocs#2667)

Author: klever34

lcci/05.03.Reverse Bits/README.md

@@ -91,6 +91,27 @@ func reverseBits(num int) (ans int) {
 }
 ```
 
+```swift
+class Solution {
+    func reverseBits(_ num: Int) -> Int {
+        var ans = 0
+        var countZeros = 0
+        var j = 0
+
+        for i in 0..<32 {
+            countZeros += (num >> i & 1 ^ 1)
+            while countZeros > 1 {
+                countZeros -= (num >> j & 1 ^ 1)
+                j += 1
+            }
+            ans = max(ans, i - j + 1)
+        }
+
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/05.03.Reverse Bits/README_EN.md

@@ -97,6 +97,27 @@ func reverseBits(num int) (ans int) {
 }
 ```
 
+```swift
+class Solution {
+    func reverseBits(_ num: Int) -> Int {
+        var ans = 0
+        var countZeros = 0
+        var j = 0
+
+        for i in 0..<32 {
+            countZeros += (num >> i & 1 ^ 1)
+            while countZeros > 1 {
+                countZeros -= (num >> j & 1 ^ 1)
+                j += 1
+            }
+            ans = max(ans, i - j + 1)
+        }
+
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/05.03.Reverse Bits/Solution.swift

@@ -0,0 +1,18 @@
+class Solution {
+    func reverseBits(_ num: Int) -> Int {
+        var ans = 0
+        var countZeros = 0
+        var j = 0
+
+        for i in 0..<32 {
+            countZeros += (num >> i & 1 ^ 1)
+            while countZeros > 1 {
+                countZeros -= (num >> j & 1 ^ 1)
+                j += 1
+            }
+            ans = max(ans, i - j + 1)
+        }
+
+        return ans
+    }
+}