feat: add solutions to lc problems: No.2409~2416

* No.2409.Count Days Spent Together
* No.2410.Maximum Matching of Players With Trainers
* No.2411.Smallest Subarrays With Maximum Bitwise OR
* No.2412.Minimum Money Required Before Transactions
* No.2413.Smallest Even Multiple
* No.2414.Length of the Longest Alphabetical Continuous Substring
* No.2415.Reverse Odd Levels of Binary Tree
* No.2416.Sum of Prefix Scores of Strings

Author: yanglbme

solution/0300-0399/0336.Palindrome Pairs/README.md

@@ -32,8 +32,6 @@
 <strong>输出：</strong>[[0,1],[1,0]]
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0500-0599/0554.Brick Wall/README.md

@@ -28,8 +28,6 @@
 <strong>输出：</strong>3
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0700-0799/0775.Global and Local Inversions/README.md

@@ -42,8 +42,6 @@
 <strong>解释：</strong>有 2 个全局倒置，和 1 个局部倒置。
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/0800-0899/0830.Positions of Large Groups/README.md

@@ -48,8 +48,6 @@
 <strong>输出：</strong>[]
 </pre>
 
-
-
 <p><strong>提示：</strong></p>
 
 <ul>

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/README.md renamed to solution/1400-1499/1460.Make Two Arrays Equal by Reversing Subarrays/README.md

@@ -1,6 +1,6 @@
-# [1460. 通过翻转子数组使两个数组相等](https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-sub-arrays)
+# [1460. 通过翻转子数组使两个数组相等](https://leetcode.cn/problems/make-two-arrays-equal-by-reversing-subarrays)
 
-[English Version](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README_EN.md)
+[English Version](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README_EN.md)
 
 ## 题目描述
 

solution/1400-1499/1460.Make Two Arrays Equal by Reversing Sub-arrays/README_EN.md renamed to solution/1400-1499/1460.Make Two Arrays Equal by Reversing Subarrays/README_EN.md

@@ -1,10 +1,10 @@
-# [1460. Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays)
+# [1460. Make Two Arrays Equal by Reversing Subarrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-subarrays)
 
-[中文文档](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README.md)
+[中文文档](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/README.md)
 
 ## Description
 
-<p>You are given two integer arrays of equal length <code>target</code> and <code>arr</code>. In one step, you can select any <strong>non-empty sub-array</strong> of <code>arr</code> and reverse it. You are allowed to make any number of steps.</p>
+<p>You are given two integer arrays of equal length <code>target</code> and <code>arr</code>. In one step, you can select any <strong>non-empty subarray</strong> of <code>arr</code> and reverse it. You are allowed to make any number of steps.</p>
 
 <p>Return <code>true</code> <em>if you can make </em><code>arr</code><em> equal to </em><code>target</code><em>&nbsp;or </em><code>false</code><em> otherwise</em>.</p>
 
@@ -15,9 +15,9 @@
 <strong>Input:</strong> target = [1,2,3,4], arr = [2,4,1,3]
 <strong>Output:</strong> true
 <strong>Explanation:</strong> You can follow the next steps to convert arr to target:
-1- Reverse sub-array [2,4,1], arr becomes [1,4,2,3]
-2- Reverse sub-array [4,2], arr becomes [1,2,4,3]
-3- Reverse sub-array [4,3], arr becomes [1,2,3,4]
+1- Reverse subarray [2,4,1], arr becomes [1,4,2,3]
+2- Reverse subarray [4,2], arr becomes [1,2,4,3]
+3- Reverse subarray [4,3], arr becomes [1,2,3,4]
 There are multiple ways to convert arr to target, this is not the only way to do so.
 </pre>