feat: add weekly contest 504 (#5238)

Author: yanglbme

solution/0300-0399/0315.Count of Smaller Numbers After Self/README.md

@@ -614,7 +614,7 @@ func merge(arr []Pair, low, mid, high int) {
 
 当右侧元素全部清空，其体现右侧所有元素均小于剩余左侧元素，累加右侧数组长度到每个剩余左侧元素的计数即可。
 
-__注意__：C++做超大数组的归并排序时，有内存爆炸风险，需使用 __缓存数组__ 避免Memory Limit Exceeded。
+**注意**：C++做超大数组的归并排序时，有内存爆炸风险，需使用 **缓存数组** 避免Memory Limit Exceeded。
 
 #### 复杂度：
 
@@ -682,7 +682,6 @@ class Solution:
         return self.combine_arrays(left_nums_indices, right_nums_indices)
 ```
 
-
 #### C++
 
 ```cpp

solution/0300-0399/0315.Count of Smaller Numbers After Self/README_EN.md

@@ -663,7 +663,6 @@ class Solution:
         return self.combine_arrays(left_nums_indices, right_nums_indices)
 ```
 
-
 #### C++
 
 ```cpp

solution/2700-2799/2736.Maximum Sum Queries/README.md

@@ -422,6 +422,7 @@ function maximumSumQueries(nums1: number[], nums2: number[], queries: number[][]
 #### 复杂度解析
 
 $n$ 是数组 $nums1$ 的长度，$m$ 是数组 $queries$ 的长度。
+
 - 时间复杂度：$O((n + m) \times \log n + m \times \log m)$。
 - 空间复杂度：$O(n + m)$。
 

solution/3900-3999/3936.Minimum Swaps to Move Zeros to End/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3936.Minimum%20Swaps%20to%20Move%20Zeros%20to%20End/README.md
+rating: 1346
+source: 第 183 场双周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3900-3999/3936.Minimum Swaps to Move Zeros to End/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3936.Minimum%20Swaps%20to%20Move%20Zeros%20to%20End/README_EN.md
+rating: 1346
+source: Biweekly Contest 183 Q1
 ---
 
 <!-- problem:start -->

solution/3900-3999/3937.Minimum Operations to Make Array Modulo Alternating I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3937.Minimum%20Operations%20to%20Make%20Array%20Modulo%20Alternating%20I/README.md
+rating: 1626
+source: 第 183 场双周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3900-3999/3937.Minimum Operations to Make Array Modulo Alternating I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3937.Minimum%20Operations%20to%20Make%20Array%20Modulo%20Alternating%20I/README_EN.md
+rating: 1626
+source: Biweekly Contest 183 Q2
 ---
 
 <!-- problem:start -->

solution/3900-3999/3938.Maximum Path Intersection Sum in a Grid/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3938.Maximum%20Path%20Intersection%20Sum%20in%20a%20Grid/README.md
+rating: 2251
+source: 第 183 场双周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3900-3999/3938.Maximum Path Intersection Sum in a Grid/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3938.Maximum%20Path%20Intersection%20Sum%20in%20a%20Grid/README_EN.md
+rating: 2251
+source: Biweekly Contest 183 Q3
 ---
 
 <!-- problem:start -->

solution/3900-3999/3939.Count Non Adjacent Subsets in a Rooted Tree/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3900-3999/3939.Count%20Non%20Adjacent%20Subsets%20in%20a%20Rooted%20Tree/README.md
+rating: 2354
+source: 第 183 场双周赛 Q4
 ---
 
 <!-- problem:start -->