feat: add weekly contest 487 (#5003)

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/0755.Pour Water/README.md

@@ -50,7 +50,7 @@ tags:
 #   w   #
 ##  # ###
 #########
- 0123456
+ 0123456    
 
 当向左或向右移动时，水可以移动到相同或更低的高度。When moving left or right, the water can only move to the same level or a lower level.
 （从水平上看，意思是该列的地形高度加上水的高度）
@@ -61,15 +61,15 @@ tags:
 #       #
 ## w# ###
 #########
- 0123456
+ 0123456    
 
 由于向左移动不会使其降落，所以停在该位置上。下一个水滴下落：
 
 #       #
 #   w   #
 ## w# ###
 #########
- 0123456
+ 0123456  
 
 
 由于新水滴向左移动可以最终下落，因此向左移动。
@@ -81,13 +81,13 @@ tags:
 #  w    #
 ## w# ###
 #########
- 0123456
+ 0123456  
 
 #       #
 #       #
 ##ww# ###
 #########
- 0123456
+ 0123456  
 
 经过刚才的阶段后，第三个水滴下落。
 由于向左移动不会最终下落，因此尝试向右移动。
@@ -98,13 +98,13 @@ tags:
 #   w   #
 ##ww# ###
 #########
- 0123456
+ 0123456  
 
 #       #
 #       #
 ##ww#w###
 #########
- 0123456
+ 0123456  
 
 最终，第四个水滴下落。
 由于向左移动不会最终下落，因此尝试向右移动。
@@ -114,14 +114,14 @@ tags:
 #   w   #
 ##ww#w###
 #########
- 0123456
+ 0123456  
 
 最终的答案为 [2,2,2,3,2,2,2]:
 
-    #
- #######
- #######
- 0123456
+    #    
+ ####### 
+ ####### 
+ 0123456 
 </pre>
 
 <p><strong>示例 2：</strong></p>

solution/2900-2999/2976.Minimum Cost to Convert String I/README.md

@@ -53,8 +53,8 @@ tags:
 <strong>输入：</strong>source = "aaaa", target = "bbbb", original = ["a","c"], changed = ["c","b"], cost = [1,2]
 <strong>输出：</strong>12
 <strong>解释：</strong>要将字符 'a' 更改为 'b'：
-- 将字符 'a' 更改为 'c'，成本为 1
-- 将字符 'c' 更改为 'b'，成本为 2
+- 将字符 'a' 更改为 'c'，成本为 1 
+- 将字符 'c' 更改为 'b'，成本为 2 
 产生的总成本是 1 + 2 = 3。
 将所有 'a' 更改为 'b'，产生的总成本是 3 * 4 = 12 。
 </pre>

solution/3800-3899/3818.Minimum Prefix Removal to Make Array Strictly Increasing/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3818.Minimum%20Prefix%20Removal%20to%20Make%20Array%20Strictly%20Increasing/README.md
+rating: 1206
+source: 第 486 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3818.Minimum Prefix Removal to Make Array Strictly Increasing/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3818.Minimum%20Prefix%20Removal%20to%20Make%20Array%20Strictly%20Increasing/README_EN.md
+rating: 1206
+source: Weekly Contest 486 Q1
 ---
 
 <!-- problem:start -->

solution/3800-3899/3819.Rotate Non Negative Elements/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3819.Rotate%20Non%20Negative%20Elements/README.md
+rating: 1381
+source: 第 486 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3819.Rotate Non Negative Elements/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3819.Rotate%20Non%20Negative%20Elements/README_EN.md
+rating: 1381
+source: Weekly Contest 486 Q2
 ---
 
 <!-- problem:start -->

solution/3800-3899/3820.Pythagorean Distance Nodes in a Tree/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3820.Pythagorean%20Distance%20Nodes%20in%20a%20Tree/README.md
+rating: 1725
+source: 第 486 场周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3800-3899/3820.Pythagorean Distance Nodes in a Tree/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3820.Pythagorean%20Distance%20Nodes%20in%20a%20Tree/README_EN.md
+rating: 1725
+source: Weekly Contest 486 Q3
 ---
 
 <!-- problem:start -->

solution/3800-3899/3821.Find Nth Smallest Integer With K One Bits/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3821.Find%20Nth%20Smallest%20Integer%20With%20K%20One%20Bits/README.md
+rating: 2069
+source: 第 486 场周赛 Q4
 ---
 
 <!-- problem:start -->