style: format code and docs with prettier

Author: yanglbme

lcci/16.22.Langtons Ant/README.md

@@ -215,7 +215,7 @@ class Solution {
         var x = 0, y = 0, p = 0
         var black = Set<[Int]>()
         var K = K
-        
+
         while K > 0 {
             let t = [x, y]
             if black.insert(t).inserted {
@@ -232,19 +232,19 @@ class Solution {
             y2 = max(y2, y)
             K -= 1
         }
-        
+
         let m = x2 - x1 + 1
         let n = y2 - y1 + 1
         var g = Array(repeating: Array(repeating: "_", count: n), count: m)
-        
+
         for t in black {
             let i = t[0] - x1
             let j = t[1] - y1
             g[i][j] = "X"
         }
-        
+
         g[x - x1][y - y1] = String(d[d.index(d.startIndex, offsetBy: p)])
-        
+
         return g.map { $0.joined() }
     }
 }

lcci/16.22.Langtons Ant/README_EN.md

@@ -235,7 +235,7 @@ class Solution {
         var x = 0, y = 0, p = 0
         var black = Set<[Int]>()
         var K = K
-        
+
         while K > 0 {
             let t = [x, y]
             if black.insert(t).inserted {
@@ -252,19 +252,19 @@ class Solution {
             y2 = max(y2, y)
             K -= 1
         }
-        
+
         let m = x2 - x1 + 1
         let n = y2 - y1 + 1
         var g = Array(repeating: Array(repeating: "_", count: n), count: m)
-        
+
         for t in black {
             let i = t[0] - x1
             let j = t[1] - y1
             g[i][j] = "X"
         }
-        
+
         g[x - x1][y - y1] = String(d[d.index(d.startIndex, offsetBy: p)])
-        
+
         return g.map { $0.joined() }
     }
 }