feat: update lc problems

Author: yanglbme

solution/0100-0199/0191.Number of 1 Bits/README_EN.md

@@ -17,7 +17,7 @@ tags:
 
 <!-- description:start -->
 
-<p>Write a function that takes the binary representation of a positive integer and returns the number of <span data-keyword="set-bit">set bits</span> it has (also known as the <a href="http://en.wikipedia.org/wiki/Hamming_weight" target="_blank">Hamming weight</a>).</p>
+<p>Given a positive integer <code>n</code>, write a function that returns the number of <span data-keyword="set-bit">set bits</span> in its binary representation (also known as the <a href="http://en.wikipedia.org/wiki/Hamming_weight" target="_blank">Hamming weight</a>).</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>

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

@@ -47,7 +47,7 @@ tags:
 
 <pre>
 <b>输入：</b>nums = [3,2,6,1,4]
-<b>输出：</b>2
+<b>输出：1</b>
 <b>解释：</b>我们执行以下操作：
 - 删除前两个元素，分数为 3 + 2 = 5 ，nums = [6,1,4] 。
 由于下一次操作的分数与前一次不相等，我们无法继续进行任何操作。

solution/3300-3399/3323.Minimize Connected Groups by Inserting Interval/README.md

@@ -16,7 +16,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3323.Mi
 
 <p>给定一个 2 维数组&nbsp;<code>intervals</code>，其中&nbsp;<code>intervals[i] = [start<sub>i</sub>, end<sub>i</sub>]</code>&nbsp;表示区间&nbsp;<code>i</code>&nbsp;的开头和结尾。另外还给定一个整数&nbsp;<code>k</code>。</p>
 
-<p>你必须向数组添加 <strong>恰好一个</strong>&nbsp;新的区间&nbsp;<code>[start<sub>new</sub>, end<sub>new</sub>]</code>&nbsp;使得：</p>
+<p>你必须向数组 <strong>恰好添加一个</strong>&nbsp;新的区间&nbsp;<code>[start<sub>new</sub>, end<sub>new</sub>]</code>&nbsp;使得：</p>
 
 <ul>
 	<li>新区间的长度，<code>end<sub>new</sub> - start<sub>new</sub></code>&nbsp;最多为&nbsp;<code>k</code>。</li>
@@ -30,7 +30,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/3300-3399/3323.Mi
 	<li>然而，区间组&nbsp;<code>[[1, 2], [3, 4]]</code>&nbsp;不是连通的，因为&nbsp;<code>(2, 3)</code>&nbsp;段没有被覆盖。</li>
 </ul>
 
-<p>返回在数组添加 <strong>恰好一个</strong> 新区间后，连通组的 <strong>最小</strong> 数量。</p>
+<p>返回在数组&nbsp;<strong>恰好添加一个</strong> 新区间后，连通组的 <strong>最小</strong> 数量。</p>
 
 <p>&nbsp;</p>
 

solution/CONTEST_README.md

@@ -26,6 +26,9 @@ comments: true
 
 ## 往期竞赛
 
+#### 第 420 场周赛(2024-10-20 10:30, 90 分钟) 参赛人数 2921
+
+
 #### 第 419 场周赛(2024-10-13 10:30, 90 分钟) 参赛人数 2924
 
 - [3318. 计算子数组的 x-sum I](/solution/3300-3399/3318.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20I/README.md)

solution/CONTEST_README_EN.md

@@ -29,6 +29,9 @@ If you want to estimate your score changes after the contest ends, you can visit
 
 ## Past Contests
 
+#### Weekly Contest 420
+
+
 #### Weekly Contest 419
 
 - [3318. Find X-Sum of All K-Long Subarrays I](/solution/3300-3399/3318.Find%20X-Sum%20of%20All%20K-Long%20Subarrays%20I/README_EN.md)