feat: add biweekly contest 164 (#4679)

Author: yanglbme

solution/0000-0099/0036.Valid Sudoku/README.md

@@ -41,7 +41,7 @@ tags:
 <p><strong>示例 1：</strong></p>
 <img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0036.Valid%20Sudoku/images/250px-sudoku-by-l2g-20050714svg.png" style="height:250px; width:250px" />
 <pre>
-<strong>输入：</strong>board =
+<strong>输入：</strong>board = 
 [["5","3",".",".","7",".",".",".","."]
 ,["6",".",".","1","9","5",".",".","."]
 ,[".","9","8",".",".",".",".","6","."]
@@ -57,7 +57,7 @@ tags:
 <p><strong>示例 2：</strong></p>
 
 <pre>
-<strong>输入：</strong>board =
+<strong>输入：</strong>board = 
 [["8","3",".",".","7",".",".",".","."]
 ,["6",".",".","1","9","5",".",".","."]
 ,[".","9","8",".",".",".",".","6","."]

solution/0000-0099/0036.Valid Sudoku/README_EN.md

@@ -37,7 +37,7 @@ tags:
 <p><strong class="example">Example 1:</strong></p>
 <img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0036.Valid%20Sudoku/images/250px-Sudoku-by-L2G-20050714.svg.png" style="height:250px; width:250px" />
 <pre>
-<strong>Input:</strong> board =
+<strong>Input:</strong> board = 
 [[&quot;5&quot;,&quot;3&quot;,&quot;.&quot;,&quot;.&quot;,&quot;7&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;]
 ,[&quot;6&quot;,&quot;.&quot;,&quot;.&quot;,&quot;1&quot;,&quot;9&quot;,&quot;5&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;]
 ,[&quot;.&quot;,&quot;9&quot;,&quot;8&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;6&quot;,&quot;.&quot;]
@@ -53,7 +53,7 @@ tags:
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
-<strong>Input:</strong> board =
+<strong>Input:</strong> board = 
 [[&quot;8&quot;,&quot;3&quot;,&quot;.&quot;,&quot;.&quot;,&quot;7&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;]
 ,[&quot;6&quot;,&quot;.&quot;,&quot;.&quot;,&quot;1&quot;,&quot;9&quot;,&quot;5&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;]
 ,[&quot;.&quot;,&quot;9&quot;,&quot;8&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;.&quot;,&quot;6&quot;,&quot;.&quot;]

solution/3000-3099/3019.Number of Changing Keys/README.md

@@ -31,7 +31,7 @@ tags:
 <pre>
 <strong>输入：</strong>s = "aAbBcC"
 <strong>输出：</strong>2
-<strong>解释：</strong>
+<strong>解释：</strong> 
 从 s[0] = 'a' 到 s[1] = 'A'，不存在按键变更，因为不计入 caps lock 或 shift 。
 从 s[1] = 'A' 到 s[2] = 'b'，按键变更。
 从 s[2] = 'b' 到 s[3] = 'B'，不存在按键变更，因为不计入 caps lock 或 shift 。

solution/3000-3099/3019.Number of Changing Keys/README_EN.md

@@ -30,7 +30,7 @@ tags:
 <pre>
 <strong>Input:</strong> s = &quot;aAbBcC&quot;
 <strong>Output:</strong> 2
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 From s[0] = &#39;a&#39; to s[1] = &#39;A&#39;, there is no change of key as caps lock or shift is not counted.
 From s[1] = &#39;A&#39; to s[2] = &#39;b&#39;, there is a change of key.
 From s[2] = &#39;b&#39; to s[3] = &#39;B&#39;, there is no change of key as caps lock or shift is not counted.

solution/3000-3099/3020.Find the Maximum Number of Elements in Subset/README_EN.md

@@ -44,7 +44,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [1,3,2,4]
 <strong>Output:</strong> 1
-<strong>Explanation:</strong> We can select the subset {1}, which can be placed in the array as [1] which follows the pattern. Hence the answer is 1. Note that we could have also selected the subsets {2}, {3}, or {4}, there may be multiple subsets which provide the same answer.
+<strong>Explanation:</strong> We can select the subset {1}, which can be placed in the array as [1] which follows the pattern. Hence the answer is 1. Note that we could have also selected the subsets {2}, {3}, or {4}, there may be multiple subsets which provide the same answer. 
 </pre>
 
 <p>&nbsp;</p>

solution/3600-3699/3658.GCD of Odd and Even Sums/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3658.GCD%20of%20Odd%20and%20Even%20Sums/README.md
+rating: 1220
+source: 第 464 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3658.GCD of Odd and Even Sums/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3658.GCD%20of%20Odd%20and%20Even%20Sums/README_EN.md
+rating: 1220
+source: Weekly Contest 464 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3659.Partition Array Into K-Distinct Groups/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3659.Partition%20Array%20Into%20K-Distinct%20Groups/README.md
+rating: 1439
+source: 第 464 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3659.Partition Array Into K-Distinct Groups/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3659.Partition%20Array%20Into%20K-Distinct%20Groups/README_EN.md
+rating: 1439
+source: Weekly Contest 464 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3660.Jump Game IX/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3660.Jump%20Game%20IX/README.md
+rating: 2187
+source: 第 464 场周赛 Q3
 ---
 
 <!-- problem:start -->