feat: add weekly contest

Author: yanglbme

solution/0600-0699/0611.Valid Triangle Number/README.md

@@ -29,7 +29,7 @@ tags:
 <pre>
 <strong>输入:</strong> nums = [2,2,3,4]
 <strong>输出:</strong> 3
-<strong>解释:</strong>有效的组合是:
+<strong>解释:</strong>有效的组合是: 
 2,3,4 (使用第一个 2)
 2,3,4 (使用第二个 2)
 2,2,3

solution/0600-0699/0611.Valid Triangle Number/README_EN.md

@@ -28,7 +28,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [2,2,3,4]
 <strong>Output:</strong> 3
-<strong>Explanation:</strong> Valid combinations are:
+<strong>Explanation:</strong> Valid combinations are: 
 2,3,4 (using the first 2)
 2,3,4 (using the second 2)
 2,2,3

solution/0900-0999/0976.Largest Perimeter Triangle/README_EN.md

@@ -35,7 +35,7 @@ tags:
 <pre>
 <strong>Input:</strong> nums = [1,2,1,10]
 <strong>Output:</strong> 0
-<strong>Explanation:</strong>
+<strong>Explanation:</strong> 
 You cannot use the side lengths 1, 1, and 2 to form a triangle.
 You cannot use the side lengths 1, 1, and 10 to form a triangle.
 You cannot use the side lengths 1, 2, and 10 to form a triangle.

solution/3600-3699/3688.Bitwise OR of Even Numbers in an Array/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3688.Bitwise%20OR%20of%20Even%20Numbers%20in%20an%20Array/README.md
+rating: 1204
+source: 第 468 场周赛 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3688.Bitwise OR of Even Numbers in an Array/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3688.Bitwise%20OR%20of%20Even%20Numbers%20in%20an%20Array/README_EN.md
+rating: 1204
+source: Weekly Contest 468 Q1
 ---
 
 <!-- problem:start -->

solution/3600-3699/3689.Maximum Total Subarray Value I/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3689.Maximum%20Total%20Subarray%20Value%20I/README.md
+rating: 1370
+source: 第 468 场周赛 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3689.Maximum Total Subarray Value I/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3689.Maximum%20Total%20Subarray%20Value%20I/README_EN.md
+rating: 1370
+source: Weekly Contest 468 Q2
 ---
 
 <!-- problem:start -->

solution/3600-3699/3690.Split and Merge Array Transformation/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3690.Split%20and%20Merge%20Array%20Transformation/README.md
+rating: 1982
+source: 第 468 场周赛 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3690.Split and Merge Array Transformation/README_EN.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3690.Split%20and%20Merge%20Array%20Transformation/README_EN.md
+rating: 1982
+source: Weekly Contest 468 Q3
 ---
 
 <!-- problem:start -->

solution/3600-3699/3691.Maximum Total Subarray Value II/README.md

@@ -2,6 +2,8 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3691.Maximum%20Total%20Subarray%20Value%20II/README.md
+rating: 2469
+source: 第 468 场周赛 Q4
 ---
 
 <!-- problem:start -->