feat: add biweekly contest 170

Author: yanglbme

solution/0700-0799/0757.Set Intersection Size At Least Two/README.md

@@ -45,7 +45,7 @@ tags:
 <strong>输入：</strong>intervals = [[1,3],[1,4],[2,5],[3,5]]
 <strong>输出：</strong>3
 <strong>解释：</strong>nums = [2, 3, 4].
-可以证明不存在元素数量为 2 的包含集合。
+可以证明不存在元素数量为 2 的包含集合。 
 </pre>
 
 <p><strong class="example">示例 3：</strong></p>
@@ -54,7 +54,7 @@ tags:
 <strong>输入：</strong>intervals = [[1,2],[2,3],[2,4],[4,5]]
 <strong>输出：</strong>5
 <strong>解释：</strong>nums = [1, 2, 3, 4, 5].
-可以证明不存在元素数量为 4 的包含集合。
+可以证明不存在元素数量为 4 的包含集合。 
 </pre>
 
 <p>&nbsp;</p>

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README.md

@@ -40,7 +40,7 @@ tags:
 <pre>
 <strong>输入：</strong>nums = [5,3,6,1,12], original = 3
 <strong>输出：</strong>24
-<strong>解释：</strong>
+<strong>解释：</strong> 
 - 3 能在 nums 中找到。3 * 2 = 6 。
 - 6 能在 nums 中找到。6 * 2 = 12 。
 - 12 能在 nums 中找到。12 * 2 = 24 。

solution/2100-2199/2154.Keep Multiplying Found Values by Two/README_EN.md

@@ -39,7 +39,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [5,3,6,1,12], original = 3
 <strong>Output:</strong> 24
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 - 3 is found in nums. 3 is multiplied by 2 to obtain 6.
 - 6 is found in nums. 6 is multiplied by 2 to obtain 12.
 - 12 is found in nums. 12 is multiplied by 2 to obtain 24.

solution/3700-3799/3745.Maximize Expression of Three Elements/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3745.Maximize%20Expression%20of%20Three%20Elements/README.md
+rating: 1218
+source: 第 476 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3745.Maximize Expression of Three Elements/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3745.Maximize%20Expression%20of%20Three%20Elements/README_EN.md
+rating: 1218
+source: Weekly Contest 476 Q1
 ---
 
 <!-- problem:start -->

solution/3700-3799/3746.Minimum String Length After Balanced Removals/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3746.Minimum%20String%20Length%20After%20Balanced%20Removals/README.md
+rating: 1326
+source: 第 476 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3746.Minimum String Length After Balanced Removals/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3746.Minimum%20String%20Length%20After%20Balanced%20Removals/README_EN.md
+rating: 1326
+source: Weekly Contest 476 Q2
 ---
 
 <!-- problem:start -->

solution/3700-3799/3747.Count Distinct Integers After Removing Zeros/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3747.Count%20Distinct%20Integers%20After%20Removing%20Zeros/README.md
+rating: 1848
+source: 第 476 场周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3747.Count Distinct Integers After Removing Zeros/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3747.Count%20Distinct%20Integers%20After%20Removing%20Zeros/README_EN.md
+rating: 1848
+source: Weekly Contest 476 Q3
 ---
 
 <!-- problem:start -->

solution/3700-3799/3748.Count Stable Subarrays/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3748.Count%20Stable%20Subarrays/README.md
+rating: 2209
+source: 第 476 场周赛 Q4
 ---
 
 <!-- problem:start -->