chore: update lc problems

Author: yanglbme

lcof2/剑指 Offer II 098. 路径的数目/README.md

@@ -254,7 +254,7 @@ class Solution {
     func uniquePaths(_ m: Int, _ n: Int) -> Int {
         var dp = Array(repeating: Array(repeating: 0, count: n), count: m)
         dp[0][0] = 1
-        
+
         for i in 0..<m {
             for j in 0..<n {
                 if i > 0 {
@@ -265,7 +265,7 @@ class Solution {
                 }
             }
         }
-        
+
         return dp[m - 1][n - 1]
     }
 }

lcof2/剑指 Offer II 099. 最小路径之和/README.md

@@ -214,17 +214,17 @@ class Solution {
         for i in 1..<m {
             dp[i][0] += dp[i-1][0]
         }
-        
+
         for j in 1..<n {
             dp[0][j] += dp[0][j-1]
         }
-        
+
         for i in 1..<m {
             for j in 1..<n {
                 dp[i][j] += min(dp[i-1][j], dp[i][j-1])
             }
         }
-        
+
         return dp[m-1][n-1]
     }
 }

solution/1000-1099/1028.Recover a Tree From Preorder Traversal/README_EN.md

@@ -31,21 +31,21 @@ tags:
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/recover-a-tree-from-preorder-traversal.png" style="width: 320px; height: 200px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/recover_tree_ex1.png" style="width: 423px; height: 200px;" />
 <pre>
 <strong>Input:</strong> traversal = &quot;1-2--3--4-5--6--7&quot;
 <strong>Output:</strong> [1,2,5,3,4,6,7]
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/screen-shot-2019-04-10-at-114101-pm.png" style="width: 256px; height: 250px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/recover_tree_ex2.png" style="width: 432px; height: 250px;" />
 <pre>
 <strong>Input:</strong> traversal = &quot;1-2--3---4-5--6---7&quot;
 <strong>Output:</strong> [1,2,5,3,null,6,null,4,null,7]
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/screen-shot-2019-04-10-at-114955-pm.png" style="width: 276px; height: 250px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/images/recover_tree_ex3.png" style="width: 305px; height: 250px;" />
 <pre>
 <strong>Input:</strong> traversal = &quot;1-401--349---90--88&quot;
 <strong>Output:</strong> [1,401,null,349,88,90]

solution/1000-1099/1028.Recover a Tree From Preorder Traversal/images/recover_tree_ex1.png

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1200-1299/1282.Gr
 rating: 1267
 source: 第 166 场周赛 Q2
 tags:
+    - 贪心
     - 数组
     - 哈希表
 ---

solution/1000-1099/1028.Recover a Tree From Preorder Traversal/images/recover_tree_ex2.png

@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/1200-1299/1282.Gr
 rating: 1267
 source: Weekly Contest 166 Q2
 tags:
+    - Greedy
     - Array
     - Hash Table
 ---