feat: add weekly contest 491 & biweekly contest 177 (#5057)

Author: yanglbme

solution/1400-1499/1404.Number of Steps to Reduce a Number in Binary Representation to One/README.md

@@ -44,9 +44,9 @@ tags:
 Step 1) 13 是奇数，加 1 得到 14 
 Step 2) 14 是偶数，除 2 得到 7
 Step 3) 7  是奇数，加 1 得到 8
-Step 4) 8  是偶数，除 2 得到 4 
+Step 4) 8  是偶数，除 2 得到 4  
 Step 5) 4  是偶数，除 2 得到 2 
-Step 6) 2  是偶数，除 2 得到 1 
+Step 6) 2  是偶数，除 2 得到 1  
 </pre>
 
 <p><strong>示例 2：</strong></p>
@@ -55,7 +55,7 @@ Step 6) 2  是偶数，除 2 得到 1&nbsp;
 <strong>输入：</strong>s = "10"
 <strong>输出：</strong>1
 <strong>解释：</strong>"10" 表示十进制数 2 。
-Step 1) 2 是偶数，除 2 得到 1
+Step 1) 2 是偶数，除 2 得到 1 
 </pre>
 
 <p><strong>示例 3：</strong></p>

solution/1400-1499/1404.Number of Steps to Reduce a Number in Binary Representation to One/README_EN.md

@@ -43,9 +43,9 @@ tags:
 Step 1) 13 is odd, add 1 and obtain 14. 
 Step 2) 14 is even, divide by 2 and obtain 7.
 Step 3) 7 is odd, add 1 and obtain 8.
-Step 4) 8 is even, divide by 2 and obtain 4. 
+Step 4) 8 is even, divide by 2 and obtain 4.  
 Step 5) 4 is even, divide by 2 and obtain 2. 
-Step 6) 2 is even, divide by 2 and obtain 1. 
+Step 6) 2 is even, divide by 2 and obtain 1.  
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -54,7 +54,7 @@ Step 6) 2 is even, divide by 2 and obtain 1.&nbsp;
 <strong>Input:</strong> s = &quot;10&quot;
 <strong>Output:</strong> 1
 <strong>Explanation:</strong> &quot;10&quot; corresponds to number 2 in their decimal representation.
-Step 1) 2 is even, divide by 2 and obtain 1.&nbsp;
+Step 1) 2 is even, divide by 2 and obtain 1.&nbsp; 
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>

solution/1600-1699/1680.Concatenation of Consecutive Binary Numbers/README.md

@@ -132,7 +132,7 @@ function concatenatedBinary(n: number): number {
     const mod = 1_000_000_007;
     let ans = 0;
     for (let i = 1; i <= n; i++) {
-        ans = ((ans * (1 << (32 - Math.clz32(i)))) % mod + i) % mod;
+        ans = (((ans * (1 << (32 - Math.clz32(i)))) % mod) + i) % mod;
     }
     return ans;
 }
@@ -281,7 +281,7 @@ function concatenatedBinary(n: number): number {
         if ((i & (i - 1)) === 0) {
             shift++;
         }
-        ans = ((ans * (1 << shift)) % mod + i) % mod;
+        ans = (((ans * (1 << shift)) % mod) + i) % mod;
     }
     return ans;
 }

solution/1600-1699/1680.Concatenation of Consecutive Binary Numbers/README_EN.md

@@ -28,7 +28,7 @@ tags:
 <pre>
 <strong>Input:</strong> n = 1
 <strong>Output:</strong> 1
-<strong>Explanation: </strong>&quot;1&quot; in binary corresponds to the decimal value 1.
+<strong>Explanation: </strong>&quot;1&quot; in binary corresponds to the decimal value 1. 
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
@@ -133,7 +133,7 @@ function concatenatedBinary(n: number): number {
     const mod = 1_000_000_007;
     let ans = 0;
     for (let i = 1; i <= n; i++) {
-        ans = ((ans * (1 << (32 - Math.clz32(i)))) % mod + i) % mod;
+        ans = (((ans * (1 << (32 - Math.clz32(i)))) % mod) + i) % mod;
     }
     return ans;
 }
@@ -282,7 +282,7 @@ function concatenatedBinary(n: number): number {
         if ((i & (i - 1)) === 0) {
             shift++;
         }
-        ans = ((ans * (1 << shift)) % mod + i) % mod;
+        ans = (((ans * (1 << shift)) % mod) + i) % mod;
     }
     return ans;
 }

solution/1600-1699/1680.Concatenation of Consecutive Binary Numbers/Solution.ts

@@ -2,7 +2,7 @@ function concatenatedBinary(n: number): number {
     const mod = 1_000_000_007;
     let ans = 0;
     for (let i = 1; i <= n; i++) {
-        ans = ((ans * (1 << (32 - Math.clz32(i)))) % mod + i) % mod;
+        ans = (((ans * (1 << (32 - Math.clz32(i)))) % mod) + i) % mod;
     }
     return ans;
 }

solution/1600-1699/1680.Concatenation of Consecutive Binary Numbers/Solution2.ts

@@ -6,7 +6,7 @@ function concatenatedBinary(n: number): number {
         if ((i & (i - 1)) === 0) {
             shift++;
         }
-        ans = ((ans * (1 << shift)) % mod + i) % mod;
+        ans = (((ans * (1 << shift)) % mod) + i) % mod;
     }
     return ans;
 }

solution/3800-3899/3847.Find the Score Difference in a Game/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3847.Find%20the%20Score%20Difference%20in%20a%20Game/README.md
+rating: 1223
+source: 第 490 场周赛 Q1
 tags:
     - 数组
     - 模拟

solution/3800-3899/3847.Find the Score Difference in a Game/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3847.Find%20the%20Score%20Difference%20in%20a%20Game/README_EN.md
+rating: 1223
+source: Weekly Contest 490 Q1
 tags:
     - Array
     - Simulation

solution/3800-3899/3848.Check Digitorial Permutation/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3848.Check%20Digitorial%20Permutation/README.md
+rating: 1420
+source: 第 490 场周赛 Q2
 tags:
     - 数学
     - 计数

solution/3800-3899/3848.Check Digitorial Permutation/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3848.Check%20Digitorial%20Permutation/README_EN.md
+rating: 1420
+source: Weekly Contest 490 Q2
 tags:
     - Math
     - Counting