style: format code and docs with prettier

Author: yanglbme

lcof/面试题48. 最长不含重复字符的子字符串/README.md

@@ -229,7 +229,7 @@ class Solution {
         var j = 0
         var vis = Set<Character>()
         let sArray = Array(s)
-        
+
         for i in 0..<sArray.count {
             while vis.contains(sArray[i]) {
                 vis.remove(sArray[j])
@@ -238,7 +238,7 @@ class Solution {
             vis.insert(sArray[i])
             ans = max(ans, i - j + 1)
         }
-        
+
         return ans
     }
 }