feat: add solutions to lc problems: No.2481~2488

* No.2481.Minimum Cuts to Divide a Circle
* No.2482.Difference Between Ones and Zeros in Row and Column
* No.2483.Minimum Penalty for a Shop
* No.2484.Count Palindromic Subsequences
* No.2485.Find the Pivot Integer
* No.2486.Append Characters to String to Make Subsequence
* No.2487.Remove Nodes From Linked List
* No.2488.Count Subarrays With Median K

Author: yanglbme

lcp/LCP 52. 二叉搜索树染色/README.md

@@ -32,8 +32,7 @@
 
 **示例 2：**
 
-> 输入：`root = [4,2,7,1,null,5,null,null,null,null,6]`
-> `ops = [[0,2,2],[1,1,5],[0,4,5],[1,5,7]]`
+> 输入：`root = [4,2,7,1,null,5,null,null,null,null,6]` > `ops = [[0,2,2],[1,1,5],[0,4,5],[1,5,7]]`
 >
 > 输出：`5`
 >

lcp/LCP 61. 气温变化趋势/README.md

@@ -22,8 +22,7 @@
 >
 > 输出：`2`
 >
-> 解释：如下表所示， 第 `2～4` 天两地气温变化趋势相同，且持续时间最长，因此返回 `4-2=2`
-> ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2061.%20%E6%B0%94%E6%B8%A9%E5%8F%98%E5%8C%96%E8%B6%8B%E5%8A%BF/images/1663902654-hlrSvs-image.png)
+> 解释：如下表所示， 第 `2～4` 天两地气温变化趋势相同，且持续时间最长，因此返回 `4-2=2` > ![image.png](https://fastly.jsdelivr.net/gh/doocs/leetcode@main/lcp/LCP%2061.%20%E6%B0%94%E6%B8%A9%E5%8F%98%E5%8C%96%E8%B6%8B%E5%8A%BF/images/1663902654-hlrSvs-image.png)
 
 **示例 2：**
 

solution/0400-0499/0467.Unique Substrings in Wraparound String/README_EN.md

@@ -4,45 +4,45 @@
 
 ## Description
 
-<p>We define the string <code>s</code> to be the infinite wraparound string of <code>&quot;abcdefghijklmnopqrstuvwxyz&quot;</code>, so <code>s</code> will look like this:</p>
+<p>We define the string <code>base</code> to be the infinite wraparound string of <code>&quot;abcdefghijklmnopqrstuvwxyz&quot;</code>, so <code>base</code> will look like this:</p>
 
 <ul>
 	<li><code>&quot;...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....&quot;</code>.</li>
 </ul>
 
-<p>Given a string <code>p</code>, return <em>the number of <strong>unique non-empty substrings</strong> of </em><code>p</code><em> are present in </em><code>s</code>.</p>
+<p>Given a string <code>s</code>, return <em>the number of <strong>unique non-empty substrings</strong> of </em><code>s</code><em> are present in </em><code>base</code>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
 
 <pre>
-<strong>Input:</strong> p = &quot;a&quot;
+<strong>Input:</strong> s = &quot;a&quot;
 <strong>Output:</strong> 1
-Explanation: Only the substring &quot;a&quot; of p is in s.
+<strong>Explanation:</strong> Only the substring &quot;a&quot; of s is in base.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
 
 <pre>
-<strong>Input:</strong> p = &quot;cac&quot;
+<strong>Input:</strong> s = &quot;cac&quot;
 <strong>Output:</strong> 2
-<strong>Explanation:</strong> There are two substrings (&quot;a&quot;, &quot;c&quot;) of p in s.
+<strong>Explanation:</strong> There are two substrings (&quot;a&quot;, &quot;c&quot;) of s in base.
 </pre>
 
 <p><strong class="example">Example 3:</strong></p>
 
 <pre>
-<strong>Input:</strong> p = &quot;zab&quot;
+<strong>Input:</strong> s = &quot;zab&quot;
 <strong>Output:</strong> 6
-<strong>Explanation:</strong> There are six substrings (&quot;z&quot;, &quot;a&quot;, &quot;b&quot;, &quot;za&quot;, &quot;ab&quot;, and &quot;zab&quot;) of p in s.
+<strong>Explanation:</strong> There are six substrings (&quot;z&quot;, &quot;a&quot;, &quot;b&quot;, &quot;za&quot;, &quot;ab&quot;, and &quot;zab&quot;) of s in base.
 </pre>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>1 &lt;= p.length &lt;= 10<sup>5</sup></code></li>
-	<li><code>p</code> consists of lowercase English letters.</li>
+	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>s</code> consists of lowercase English letters.</li>
 </ul>
 
 ## Solutions

solution/0500-0599/0587.Erect the Fence/README_EN.md

@@ -6,33 +6,35 @@
 
 <p>You are given an array <code>trees</code> where <code>trees[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents the ___location of a tree in the garden.</p>
 
-<p>You are asked to fence the entire garden using the minimum length of rope as it is expensive. The garden is well fenced only if <strong>all the trees are enclosed</strong>.</p>
+<p>Fence the entire garden using the minimum length of rope, as it is expensive. The garden is well-fenced only if <strong>all the trees are enclosed</strong>.</p>
 
-<p>Return <em>the coordinates of trees that are exactly located on the fence perimeter</em>.</p>
+<p>Return <em>the coordinates of trees that are exactly located on the fence perimeter</em>. You may return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0587.Erect%20the%20Fence/images/erect2-plane.jpg" style="width: 509px; height: 500px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0587.Erect%20the%20Fence/images/erect2-plane.jpg" style="width: 400px; height: 393px;" />
 <pre>
-<strong>Input:</strong> points = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]
-<strong>Output:</strong> [[1,1],[2,0],[3,3],[2,4],[4,2]]
+<strong>Input:</strong> trees = [[1,1],[2,2],[2,0],[2,4],[3,3],[4,2]]
+<strong>Output:</strong> [[1,1],[2,0],[4,2],[3,3],[2,4]]
+<strong>Explanation:</strong> All the trees will be on the perimeter of the fence except the tree at [2, 2], which will be inside the fence.
 </pre>
 
 <p><strong class="example">Example 2:</strong></p>
-<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0587.Erect%20the%20Fence/images/erect1-plane.jpg" style="width: 509px; height: 500px;" />
+<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0587.Erect%20the%20Fence/images/erect1-plane.jpg" style="width: 400px; height: 393px;" />
 <pre>
-<strong>Input:</strong> points = [[1,2],[2,2],[4,2]]
+<strong>Input:</strong> trees = [[1,2],[2,2],[4,2]]
 <strong>Output:</strong> [[4,2],[2,2],[1,2]]
+<strong>Explanation:</strong> The fence forms a line that passes through all the trees.
 </pre>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>1 &lt;= points.length &lt;= 3000</code></li>
-	<li><code>points[i].length == 2</code></li>
+	<li><code>1 &lt;= trees.length &lt;= 3000</code></li>
+	<li><code>trees[i].length == 2</code></li>
 	<li><code>0 &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 100</code></li>
-	<li>All the given points are <strong>unique</strong>.</li>
+	<li>All the given positions are <strong>unique</strong>.</li>
 </ul>
 
 ## Solutions

solution/0600-0699/0608.Tree Node/README_EN.md

@@ -30,7 +30,7 @@ The given structure is always a valid tree.
 
 <p>Write an SQL query to report the type of each node in the tree.</p>
 
-<p>Return the result table <strong>ordered</strong> by <code>id</code> <strong>in ascending order</strong>.</p>
+<p>Return the result table in <strong>any order</strong>.</p>
 
 <p>The query result format is in the following example.</p>
 

solution/0800-0899/0809.Expressive Words/README.md

@@ -6,37 +6,36 @@
 
 <!-- 这里写题目描述 -->
 
-<p>有时候人们会用重复写一些字母来表示额外的感受，比如 <code>"hello" -> "heeellooo"</code>, <code>"hi" -> "hiii"</code>。我们将相邻字母都相同的一串字符定义为相同字母组，例如："h", "eee", "ll", "ooo"。</p>
+<p>有时候人们会用重复写一些字母来表示额外的感受，比如 <code>"hello" -&gt; "heeellooo"</code>, <code>"hi" -&gt; "hiii"</code>。我们将相邻字母都相同的一串字符定义为相同字母组，例如："h", "eee", "ll", "ooo"。</p>
 
-<p>对于一个给定的字符串 S ，如果另一个单词能够通过将一些字母组扩张从而使其和 S 相同，我们将这个单词定义为可扩张的（stretchy）。扩张操作定义如下：选择一个字母组（包含字母 <code>c</code> ），然后往其中添加相同的字母 <code>c</code> 使其长度达到 3 或以上。</p>
+<p>对于一个给定的字符串 S ，如果另一个单词能够通过将一些字母组扩张从而使其和 S 相同，我们将这个单词定义为可扩张的（stretchy）。扩张操作定义如下：选择一个字母组（包含字母&nbsp;<code>c</code>&nbsp;），然后往其中添加相同的字母&nbsp;<code>c</code>&nbsp;使其长度达到 3 或以上。</p>
 
-<p>例如，以 "hello" 为例，我们可以对字母组 "o" 扩张得到 "hellooo"，但是无法以同样的方法得到 "helloo" 因为字母组 "oo" 长度小于 3。此外，我们可以进行另一种扩张 "ll" -> "lllll" 以获得 "helllllooo"。如果 <code>S = "helllllooo"</code>，那么查询词 "hello" 是可扩张的，因为可以对它执行这两种扩张操作使得 <code>query = "hello" -> "hellooo" -> "helllllooo" = S</code>。</p>
+<p>例如，以&nbsp;"hello" 为例，我们可以对字母组&nbsp;"o" 扩张得到 "hellooo"，但是无法以同样的方法得到 "helloo" 因为字母组 "oo" 长度小于&nbsp;3。此外，我们可以进行另一种扩张 "ll" -&gt; "lllll" 以获得&nbsp;"helllllooo"。如果&nbsp;<code>s = "helllllooo"</code>，那么查询词&nbsp;"hello" 是可扩张的，因为可以对它执行这两种扩张操作使得&nbsp;<code>query = "hello" -&gt; "hellooo" -&gt;&nbsp;"helllllooo" = s</code>。</p>
 
 <p>输入一组查询单词，输出其中可扩张的单词数量。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>示例：</strong></p>
 
 <pre>
 <strong>输入：</strong> 
-S = "heeellooo"
+s = "heeellooo"
 words = ["hello", "hi", "helo"]
 <strong>输出：</strong>1
 <strong>解释</strong>：
 我们能通过扩张 "hello" 的 "e" 和 "o" 来得到 "heeellooo"。
 我们不能通过扩张 "helo" 来得到 "heeellooo" 因为 "ll" 的长度小于 3 。
 </pre>
 
-<p> </p>
+<p>&nbsp;</p>
 
 <p><strong>提示：</strong></p>
 
 <ul>
-	<li><code>0 <= len(S) <= 100</code>。</li>
-	<li><code>0 <= len(words) <= 100</code>。</li>
-	<li><code>0 <= len(words[i]) <= 100</code>。</li>
-	<li><code>S</code> 和所有在 <code>words</code> 中的单词都只由小写字母组成。</li>
+	<li><code>1 &lt;= s.length, words.length &lt;= 100</code></li>
+	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
+	<li><font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="font-size: 12.6px; background-color: rgb(249, 242, 244);">s</span></font> 和所有在&nbsp;<code>words</code>&nbsp;中的单词都只由小写字母组成。</li>
 </ul>
 
 ## 解法

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README.md

@@ -72,8 +72,7 @@
 ```python
 class Solution:
     def check(self, nums: List[int]) -> bool:
-        n = len(nums)
-        return sum(v > nums[(i + 1) % n] for i, v in enumerate(nums)) <= 1
+        return sum(v > nums[(i + 1) % len(nums)] for i, v in enumerate(nums)) <= 1
 ```
 
 ### **Java**
@@ -83,9 +82,8 @@ class Solution:
 ```java
 class Solution {
     public boolean check(int[] nums) {
-        int n = nums.length;
         int cnt = 0;
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0, n = nums.length; i < n; ++i) {
             if (nums[i] > nums[(i + 1) % n]) {
                 ++cnt;
             }
@@ -101,9 +99,8 @@ class Solution {
 class Solution {
 public:
     bool check(vector<int>& nums) {
-        int n = nums.size();
         int cnt = 0;
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0, n = nums.size(); i < n; ++i) {
             cnt += nums[i] > (nums[(i + 1) % n]);
         }
         return cnt <= 1;
@@ -115,10 +112,9 @@ public:
 
 ```go
 func check(nums []int) bool {
-	n := len(nums)
 	cnt := 0
 	for i, v := range nums {
-		if v > nums[(i+1)%n] {
+		if v > nums[(i+1)%len(nums)] {
 			cnt++
 		}
 	}

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README_EN.md

@@ -54,18 +54,16 @@ You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
 ```python
 class Solution:
     def check(self, nums: List[int]) -> bool:
-        n = len(nums)
-        return sum(v > nums[(i + 1) % n] for i, v in enumerate(nums)) <= 1
+        return sum(v > nums[(i + 1) % len(nums)] for i, v in enumerate(nums)) <= 1
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public boolean check(int[] nums) {
-        int n = nums.length;
         int cnt = 0;
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0, n = nums.length; i < n; ++i) {
             if (nums[i] > nums[(i + 1) % n]) {
                 ++cnt;
             }
@@ -81,9 +79,8 @@ class Solution {
 class Solution {
 public:
     bool check(vector<int>& nums) {
-        int n = nums.size();
         int cnt = 0;
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0, n = nums.size(); i < n; ++i) {
             cnt += nums[i] > (nums[(i + 1) % n]);
         }
         return cnt <= 1;
@@ -95,10 +92,9 @@ public:
 
 ```go
 func check(nums []int) bool {
-	n := len(nums)
 	cnt := 0
 	for i, v := range nums {
-		if v > nums[(i+1)%n] {
+		if v > nums[(i+1)%len(nums)] {
 			cnt++
 		}
 	}

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/Solution.cpp

@@ -1,9 +1,8 @@
 class Solution {
 public:
     bool check(vector<int>& nums) {
-        int n = nums.size();
         int cnt = 0;
-        for (int i = 0; i < n; ++i) {
+        for (int i = 0, n = nums.size(); i < n; ++i) {
             cnt += nums[i] > (nums[(i + 1) % n]);
         }
         return cnt <= 1;

solution/1700-1799/1752.Check if Array Is Sorted and Rotated/Solution.go

@@ -1,8 +1,7 @@
 func check(nums []int) bool {
-	n := len(nums)
 	cnt := 0
 	for i, v := range nums {
-		if v > nums[(i+1)%n] {
+		if v > nums[(i+1)%len(nums)] {
 			cnt++
 		}
 	}