feat: update lc problems (#2737)

Author: yanglbme

lcci/16.04.Tic-Tac-Toe/README.md

@@ -230,6 +230,7 @@ function tictactoe(board: string[]): string {
     return hasEmptyGrid ? 'Pending' : 'Draw';
 }
 ```
+
 ```swift
 class Solution {
     func tictactoe(_ board: [String]) -> String {
@@ -238,7 +239,7 @@ class Solution {
         var cols = Array(repeating: 0, count: n)
         var diagonal = 0, antiDiagonal = 0
         var hasEmptyGrid = false
-        
+
         for i in 0..<n {
             for j in 0..<n {
                 let c = Array(board[i])[j]
@@ -260,7 +261,7 @@ class Solution {
                 }
             }
         }
-        
+
         return hasEmptyGrid ? "Pending" : "Draw"
     }
 }

lcci/16.04.Tic-Tac-Toe/README_EN.md

@@ -251,7 +251,7 @@ class Solution {
         var cols = Array(repeating: 0, count: n)
         var diagonal = 0, antiDiagonal = 0
         var hasEmptyGrid = false
-        
+
         for i in 0..<n {
             for j in 0..<n {
                 let c = Array(board[i])[j]
@@ -273,7 +273,7 @@ class Solution {
                 }
             }
         }
-        
+
         return hasEmptyGrid ? "Pending" : "Draw"
     }
 }

lcci/16.06.Smallest Difference/README.md

@@ -146,7 +146,7 @@ class Solution {
     func smallestDifference(_ a: [Int], _ b: [Int]) -> Int {
         let sortedB = b.sorted()
         var ans = Int.max
-        
+
         for x in a {
             let j = search(sortedB, x)
             if j < sortedB.count {
@@ -156,10 +156,10 @@ class Solution {
                 ans = min(ans, abs(x - sortedB[j - 1]))
             }
         }
-        
+
         return ans
     }
-    
+
     private func search(_ nums: [Int], _ x: Int) -> Int {
         var l = 0
         var r = nums.count

lcci/16.06.Smallest Difference/README_EN.md

@@ -152,7 +152,7 @@ class Solution {
     func smallestDifference(_ a: [Int], _ b: [Int]) -> Int {
         let sortedB = b.sorted()
         var ans = Int.max
-        
+
         for x in a {
             let j = search(sortedB, x)
             if j < sortedB.count {
@@ -162,10 +162,10 @@ class Solution {
                 ans = min(ans, abs(x - sortedB[j - 1]))
             }
         }
-        
+
         return ans
     }
-    
+
     private func search(_ nums: [Int], _ x: Int) -> Int {
         var l = 0
         var r = nums.count

solution/0000-0099/0008.String to Integer (atoi)/README_EN.md

@@ -14,7 +14,7 @@
 	<li><strong>Whitespace</strong>: Ignore any leading whitespace (<code>&quot; &quot;</code>).</li>
 	<li><strong>Signedness</strong>: Determine the sign by checking if the next character is <code>&#39;-&#39;</code> or <code>&#39;+&#39;</code>, assuming positivity is neither present.</li>
 	<li><strong>Conversion</strong>: Read the integer by skipping leading zeros&nbsp;until a non-digit character is encountered or the end of the string is reached. If no digits were read, then the result is 0.</li>
-	<li><strong>Edge case</strong>: If the integer is out of the 32-bit signed integer range <code>[-2<sup>31</sup>, 2<sup>31</sup> - 1]</code>, then round the integer to remain in the range. Specifically, integers less than <code>-2<sup>31</sup></code> should be rounded to <code>-2<sup>31</sup></code>, and integers greater than <code>2<sup>31</sup> - 1</code> should be rounded to <code>2<sup>31</sup> - 1</code>.</li>
+	<li><strong>Rounding</strong>: If the integer is out of the 32-bit signed integer range <code>[-2<sup>31</sup>, 2<sup>31</sup> - 1]</code>, then round the integer to remain in the range. Specifically, integers less than <code>-2<sup>31</sup></code> should be rounded to <code>-2<sup>31</sup></code>, and integers greater than <code>2<sup>31</sup> - 1</code> should be rounded to <code>2<sup>31</sup> - 1</code>.</li>
 </ol>
 
 <p>Return the integer as the final result.</p>

solution/0300-0399/0305.Number of Islands II/README.md

@@ -2,7 +2,7 @@
 
 [English Version](/solution/0300-0399/0305.Number%20of%20Islands%20II/README_EN.md)
 
-<!-- tags:并查集,数组 -->
+<!-- tags:并查集,数组,哈希表 -->
 
 ## 题目描述
 

solution/0300-0399/0305.Number of Islands II/README_EN.md

@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0300-0399/0305.Number%20of%20Islands%20II/README.md)
 
-<!-- tags:Union Find,Array -->
+<!-- tags:Union Find,Array,Hash Table -->
 
 ## Description
 

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README.md

@@ -2,7 +2,7 @@
 
 [English Version](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README_EN.md)
 
-<!-- tags:树,深度优先搜索,广度优先搜索,哈希表,二叉树 -->
+<!-- tags:树,深度优先搜索,广度优先搜索,哈希表,二叉树,排序 -->
 
 ## 题目描述
 

solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md

@@ -2,7 +2,7 @@
 
 [中文文档](/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/README.md)
 
-<!-- tags:Tree,Depth-First Search,Breadth-First Search,Hash Table,Binary Tree -->
+<!-- tags:Tree,Depth-First Search,Breadth-First Search,Hash Table,Binary Tree,Sorting -->
 
 ## Description
 

solution/0700-0799/0745.Prefix and Suffix Search/README.md

@@ -2,7 +2,7 @@
 
 [English Version](/solution/0700-0799/0745.Prefix%20and%20Suffix%20Search/README_EN.md)
 
-<!-- tags:设计,字典树,哈希表,字符串 -->
+<!-- tags:设计,字典树,数组,哈希表,字符串 -->
 
 ## 题目描述