style: format code and docs with prettier

Author: yanglbme

lcof/面试题42. 连续子数组的最大和/README.md

@@ -196,12 +196,12 @@ class Solution {
     func maxSubArray(_ nums: [Int]) -> Int {
         var ans = Int.min
         var currentSum = 0
-        
+
         for x in nums {
             currentSum = max(currentSum, 0) + x
             ans = max(ans, currentSum)
         }
-        
+
         return ans
     }
 }