feat: update lc problems (doocs#3502)

Author: yanglbme

solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README.md

@@ -39,7 +39,7 @@ tags:
 
 <pre><strong>输入：</strong>s = &quot;deeedbbcccbdaa&quot;, k = 3
 <strong>输出：</strong>&quot;aa&quot;
-<strong>解释：
+<strong>解释： 
 </strong>先删除 &quot;eee&quot; 和 &quot;ccc&quot;，得到 &quot;ddbbbdaa&quot;
 再删除 &quot;bbb&quot;，得到 &quot;dddaa&quot;
 最后删除 &quot;ddd&quot;，得到 &quot;aa&quot;</pre>

solution/1200-1299/1209.Remove All Adjacent Duplicates in String II/README_EN.md

@@ -38,7 +38,7 @@ tags:
 <pre>
 <strong>Input:</strong> s = &quot;deeedbbcccbdaa&quot;, k = 3
 <strong>Output:</strong> &quot;aa&quot;
-<strong>Explanation:
+<strong>Explanation: 
 </strong>First delete &quot;eee&quot; and &quot;ccc&quot;, get &quot;ddbbbdaa&quot;
 Then delete &quot;bbb&quot;, get &quot;dddaa&quot;
 Finally delete &quot;ddd&quot;, get &quot;aa&quot;</pre>

solution/1300-1399/1367.Linked List in Binary Tree/README.md

@@ -7,7 +7,6 @@ source: 第 178 场周赛 Q3
 tags:
     - 树
     - 深度优先搜索
-    - 广度优先搜索
     - 链表
     - 二叉树
 ---

solution/1300-1399/1367.Linked List in Binary Tree/README_EN.md

@@ -7,7 +7,6 @@ source: Weekly Contest 178 Q3
 tags:
     - Tree
     - Depth-First Search
-    - Breadth-First Search
     - Linked List
     - Binary Tree
 ---

solution/2100-2199/2181.Merge Nodes in Between Zeros/README_EN.md

@@ -31,7 +31,7 @@ tags:
 <pre>
 <strong>Input:</strong> head = [0,3,1,0,4,5,2,0]
 <strong>Output:</strong> [4,11]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The above figure represents the given linked list. The modified list contains
 - The sum of the nodes marked in green: 3 + 1 = 4.
 - The sum of the nodes marked in red: 4 + 5 + 2 = 11.
@@ -42,7 +42,7 @@ The above figure represents the given linked list. The modified list contains
 <pre>
 <strong>Input:</strong> head = [0,1,0,3,0,2,2,0]
 <strong>Output:</strong> [1,3,4]
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The above figure represents the given linked list. The modified list contains
 - The sum of the nodes marked in green: 1 = 1.
 - The sum of the nodes marked in red: 3 = 3.

solution/2300-2399/2398.Maximum Number of Robots Within Budget/README_EN.md

@@ -35,7 +35,7 @@ tags:
 <pre>
 <strong>Input:</strong> chargeTimes = [3,6,1,3,4], runningCosts = [2,1,3,4,5], budget = 25
 <strong>Output:</strong> 3
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 It is possible to run all individual and consecutive pairs of robots within budget.
 To obtain answer 3, consider the first 3 robots. The total cost will be max(3,6,1) + 3 * sum(2,1,3) = 6 + 3 * 6 = 24 which is less than 25.
 It can be shown that it is not possible to run more than 3 consecutive robots within budget, so we return 3.

solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README.md

@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2472.Ma
 rating: 2013
 source: 第 319 场周赛 Q4
 tags:
+    - 贪心
+    - 双指针
     - 字符串
     - 动态规划
 ---

solution/2400-2499/2472.Maximum Number of Non-overlapping Palindrome Substrings/README_EN.md

@@ -5,6 +5,8 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2472.Ma
 rating: 2013
 source: Weekly Contest 319 Q4
 tags:
+    - Greedy
+    - Two Pointers
     - String
     - Dynamic Programming
 ---

solution/2500-2599/2532.Time to Cross a Bridge/README_EN.md

@@ -43,6 +43,7 @@ tags:
 <ul>
 	<li>Only one worker can use the bridge at a time.</li>
 	<li>When the bridge is unused prioritize the <strong>least efficient</strong> worker on the right side to cross. If there are no workers on the right side, prioritize the <strong>least efficient</strong> worker on the left side to cross.</li>
+	<li>If enough workers have already been dispatched from the left side to pick up all the remaining boxes, <strong>no more</strong> workers will be sent from the left side.</li>
 </ul>
 
 <p>Return the <strong>elapsed minutes</strong> at which the last box reaches the <strong>left side of the bridge</strong>.</p>

solution/3000-3099/3038.Maximum Number of Operations With the Same Score I/README_EN.md

@@ -19,38 +19,56 @@ tags:
 
 <!-- description:start -->
 
-<p>Given an array of integers called <code>nums</code>, you can perform the following operation while <code>nums</code> contains <strong>at least</strong> <code>2</code> elements:</p>
+<p>You are given an array of integers <code>nums</code>. Consider the following operation:</p>
 
 <ul>
-	<li>Choose the first two elements of <code>nums</code> and delete them.</li>
+	<li>Delete the first two elements <code>nums</code> and define the <em>score</em> of the operation as the sum of these two elements.</li>
 </ul>
 
-<p>The<strong> score</strong> of the operation is the sum of the deleted elements.</p>
+<p>You can perform this operation until <code>nums</code> contains fewer than two elements. Additionally, the <strong>same</strong> <em>score</em> must be achieved in <strong>all</strong> operations.</p>
 
-<p>Your task is to find the <strong>maximum</strong> number of operations that can be performed, such that <strong>all operations have the same score</strong>.</p>
-
-<p>Return <em>the <strong>maximum</strong> number of operations possible that satisfy the condition mentioned above</em>.</p>
+<p>Return the <strong>maximum</strong> number of operations you can perform.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [3,2,1,4,5]
-<strong>Output:</strong> 2
-<strong>Explanation:</strong> We perform the following operations:
-- Delete the first two elements, with score 3 + 2 = 5, nums = [1,4,5].
-- Delete the first two elements, with score 1 + 4 = 5, nums = [5].
-We are unable to perform any more operations as nums contain only 1 element.</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [3,2,1,4,5]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">2</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>We can perform the first operation with the score <code>3 + 2 = 5</code>. After this operation, <code>nums = [1,4,5]</code>.</li>
+	<li>We can perform the second operation as its score is <code>4 + 1 = 5</code>, the same as the previous operation. After this operation, <code>nums = [5]</code>.</li>
+	<li>As there are fewer than two elements, we can&#39;t perform more operations.</li>
+</ul>
+</div>
 
 <p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> nums = [3,2,6,1,4]
-<strong>Output:</strong> 1
-<strong>Explanation:</strong> We perform the following operations:
-- Delete the first two elements, with score 3 + 2 = 5, nums = [6,1,4].
-We are unable to perform any more operations as the score of the next operation isn&#39;t the same as the previous one.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [1,5,3,3,4,1,3,2,2,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<ul>
+	<li>We can perform the first operation with the score <code>1 + 5 = 6</code>. After this operation, <code>nums = [3,3,4,1,3,2,2,3]</code>.</li>
+	<li>We can perform the second operation as its score is <code>3 + 3 = 6</code>, the same as the previous operation. After this operation, <code>nums = [4,1,3,2,2,3]</code>.</li>
+	<li>We cannot perform the next operation as its score is <code>4 + 1 = 5</code>, which is different from the previous scores.</li>
+</ul>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">nums = [5,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">1</span></p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>