feat: update lc problems

Author: yanglbme

solution/1500-1599/1526.Minimum Number of Increments on Subarrays to Form a Target Array/README.md

@@ -56,7 +56,7 @@ tags:
 
 <pre><strong>输入：</strong>target = [3,1,5,4,2]
 <strong>输出：</strong>7
-<strong>解释：</strong>(initial)[0,0,0,0,0] -&gt; [1,1,1,1,1] -&gt; [2,1,1,1,1] -&gt; [3,1,1,1,1]
+<strong>解释：</strong>(initial)[0,0,0,0,0] -&gt; [1,1,1,1,1] -&gt; [2,1,1,1,1] -&gt; [3,1,1,1,1] 
                                   -&gt; [3,1,2,2,2] -&gt; [3,1,3,3,2] -&gt; [3,1,4,4,2] -&gt; [3,1,5,4,2] (target)。
 </pre>
 

solution/2100-2199/2130.Maximum Twin Sum of a Linked List/README_EN.md

@@ -39,7 +39,7 @@ tags:
 <strong>Explanation:</strong>
 Nodes 0 and 1 are the twins of nodes 3 and 2, respectively. All have twin sum = 6.
 There are no other nodes with twins in the linked list.
-Thus, the maximum twin sum of the linked list is 6.
+Thus, the maximum twin sum of the linked list is 6. 
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -51,7 +51,7 @@ Thus, the maximum twin sum of the linked list is 6.
 The nodes with twins present in this linked list are:
 - Node 0 is the twin of node 3 having a twin sum of 4 + 3 = 7.
 - Node 1 is the twin of node 2 having a twin sum of 2 + 2 = 4.
-Thus, the maximum twin sum of the linked list is max(7, 4) = 7.
+Thus, the maximum twin sum of the linked list is max(7, 4) = 7. 
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>

solution/2500-2599/2528.Maximize the Minimum Powered City/README_EN.md

@@ -45,8 +45,8 @@ tags:
 <pre>
 <strong>Input:</strong> stations = [1,2,4,5,0], r = 1, k = 2
 <strong>Output:</strong> 5
-<strong>Explanation:</strong>
-One of the optimal ways is to install both the power stations at city 1.
+<strong>Explanation:</strong> 
+One of the optimal ways is to install both the power stations at city 1. 
 So stations will become [1,4,4,5,0].
 - City 0 is provided by 1 + 4 = 5 power stations.
 - City 1 is provided by 1 + 4 + 4 = 9 power stations.
@@ -62,7 +62,7 @@ Since it is not possible to obtain a larger power, we return 5.
 <pre>
 <strong>Input:</strong> stations = [4,4,4,4], r = 0, k = 3
 <strong>Output:</strong> 4
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 It can be proved that we cannot make the minimum power of a city greater than 4.
 </pre>
 

solution/3600-3699/3632.Subarrays with XOR at Least K/README.md

@@ -4,14 +4,14 @@ difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README.md
 tags:
     - 位运算
-    - 树
+    - 字典树
     - 数组
     - 前缀和
 ---
 
 <!-- problem:start -->
 
-# [3632. 子数组异或至少为 K 的数目 🔒](https://leetcode.cn/problems/subarrays-with-xor-at-least-k)
+# [3632. 异或至少为 K 的子数组数目 🔒](https://leetcode.cn/problems/subarrays-with-xor-at-least-k)
 
 [English Version](/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README_EN.md)
 

solution/3600-3699/3632.Subarrays with XOR at Least K/README_EN.md

@@ -4,7 +4,7 @@ difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README_EN.md
 tags:
     - Bit Manipulation
-    - Tree
+    - Trie
     - Array
     - Prefix Sum
 ---

solution/3600-3699/3657.Find Loyal Customers/README.md

@@ -40,6 +40,8 @@ transaction_type 可以是 “purchase” 或 “refund”。
 	<li>他们的 <strong>退款率</strong>&nbsp;少于&nbsp;<code>20%</code>。</li>
 </ul>
 
+<p>退款率是退款交易占交易总数（购买加退款）的比例，计算公式为退款交易数量除以总交易数量。</p>
+
 <p>返回结果表以&nbsp;<code>customer_id</code> <strong>升序</strong>&nbsp;排序。</p>
 
 <p>结果格式如下所示。</p>

solution/3600-3699/3657.Find Loyal Customers/README_EN.md

@@ -40,6 +40,8 @@ transaction_type can be either 'purchase' or 'refund'.
 	<li>Their <strong>refund rate</strong> is less than <code>20%</code> .</li>
 </ul>
 
+<p><em>Refund rate</em> is the proportion of transactions that are refunds, calculated as the number of refund transactions divided by the total number of transactions (purchases plus refunds).</p>
+
 <p>Return <em>the result table&nbsp;ordered by</em> <code>customer_id</code> <em>in <strong>ascending</strong> order</em>.</p>
 
 <p>The result format is in the following example.</p>

solution/3600-3699/3666.Minimum Operations to Equalize Binary String/README.md

@@ -6,9 +6,10 @@ rating: 2476
 source: 第 164 场双周赛 Q4
 tags:
     - 广度优先搜索
-    - 哈希表
+    - 并查集
     - 数学
     - 字符串
+    - 有序集合
 ---
 
 <!-- problem:start -->

solution/3600-3699/3666.Minimum Operations to Equalize Binary String/README_EN.md

@@ -6,9 +6,10 @@ rating: 2476
 source: Biweekly Contest 164 Q4
 tags:
     - Breadth-First Search
-    - Hash Table
+    - Union Find
     - Math
     - String
+    - Ordered Set
 ---
 
 <!-- problem:start -->

solution/3700-3799/3701.Compute Alternating Sum/README.md

@@ -4,6 +4,9 @@ difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3701.Compute%20Alternating%20Sum/README.md
 rating: 1228
 source: 第 470 场周赛 Q1
+tags:
+    - 数组
+    - 模拟
 ---
 
 <!-- problem:start -->