feat: add weekly contest 489 and biweekly contest 176

Author: yanglbme

README.md

@@ -52,7 +52,7 @@
 - [乘积小于 K 的子数组](/solution/0700-0799/0713.Subarray%20Product%20Less%20Than%20K/README.md) - `双指针`
 - [位 1 的个数](/solution/0100-0199/0191.Number%20of%201%20Bits/README.md) - `位运算`、`lowbit`
 - [合并区间](/solution/0000-0099/0056.Merge%20Intervals/README.md) - `区间合并`
-  <!-- 排序算法、待补充 -->
+      <!-- 排序算法、待补充 -->
 
 ### 2. 数据结构
 

solution/0700-0799/0799.Champagne Tower/Solution.ts

@@ -12,4 +12,4 @@ function champagneTower(poured: number, query_row: number, query_glass: number):
         }
     }
     return f[query_row][query_glass];
-}
+}

solution/0700-0799/0799.Champagne Tower/Solution2.ts

@@ -12,4 +12,4 @@ function champagneTower(poured: number, query_row: number, query_glass: number):
         f = g;
     }
     return Math.min(1, f[query_glass]);
-}
+}

solution/1900-1999/1959.Minimum Total Space Wasted With K Resizing Operations/README_EN.md

@@ -44,7 +44,7 @@ The total wasted space is (20 - 10) + (20 - 20) = 10.
 <strong>Input:</strong> nums = [10,20,30], k = 1
 <strong>Output:</strong> 10
 <strong>Explanation:</strong> size = [20,20,30].
-We can set the initial size to be 20 and resize to 30 at time 2.
+We can set the initial size to be 20 and resize to 30 at time 2. 
 The total wasted space is (20 - 10) + (20 - 20) + (30 - 30) = 10.
 </pre>
 

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md

@@ -36,7 +36,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [1,15,6,3]
 <strong>Output:</strong> 9
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 The element sum of nums is 1 + 15 + 6 + 3 = 25.
 The digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.
 The absolute difference between the element sum and digit sum is |25 - 16| = 9.

solution/3800-3899/3833.Count Dominant Indices/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3833.Count%20Dominant%20Indices/README.md
+rating: 1171
+source: 第 488 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3833.Count Dominant Indices/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3833.Count%20Dominant%20Indices/README_EN.md
+rating: 1171
+source: Weekly Contest 488 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3834.Merge Adjacent Equal Elements/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3834.Merge%20Adjacent%20Equal%20Elements/README.md
+rating: 1428
+source: 第 488 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3834.Merge Adjacent Equal Elements/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3834.Merge%20Adjacent%20Equal%20Elements/README_EN.md
+rating: 1428
+source: Weekly Contest 488 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3835.Count Subarrays With Cost Less Than or Equal to K/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3835.Count%20Subarrays%20With%20Cost%20Less%20Than%20or%20Equal%20to%20K/README.md
+rating: 1759
+source: 第 488 场周赛 Q3
 ---
 
 <!-- problem:start -->