doocs · acbin · Apr 21, 2024 · Apr 21, 2024
diff --git a/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md b/solution/0000-0099/0030.Substring with Concatenation of All Words/README_EN.md
@@ -8,13 +8,13 @@
 
 <p>You are given a string <code>s</code> and an array of strings <code>words</code>. All the strings of <code>words</code> are of <strong>the same length</strong>.</p>
 
-<p>A <strong>concatenated string</strong>&nbsp;is a string that exactly contains all the strings of any permutation of <code>words</code> concatenated.</p>
+<p>A <strong>concatenated string</strong> is a string that exactly contains all the strings of any permutation of <code>words</code> concatenated.</p>
 
 <ul>
 	<li>For example, if <code>words = [&quot;ab&quot;,&quot;cd&quot;,&quot;ef&quot;]</code>, then <code>&quot;abcdef&quot;</code>, <code>&quot;abefcd&quot;</code>, <code>&quot;cdabef&quot;</code>, <code>&quot;cdefab&quot;</code>, <code>&quot;efabcd&quot;</code>, and <code>&quot;efcdab&quot;</code> are all concatenated strings. <code>&quot;acdbef&quot;</code> is not a concatenated string because it is not the concatenation of any permutation of <code>words</code>.</li>
 </ul>
 
-<p>Return an array of&nbsp;<em>the starting indices</em> of all the concatenated substrings in<em> </em><code>s</code>. You can return the answer in <strong>any order</strong>.</p>
+<p>Return an array of <em>the starting indices</em> of all the concatenated substrings in <code>s</code>. You can return the answer in <strong>any order</strong>.</p>
 
 <p>&nbsp;</p>
 <p><strong class="example">Example 1:</strong></p>
@@ -27,8 +27,7 @@
 <p><strong>Explanation:</strong></p>
 
 <p>The substring starting at 0 is <code>&quot;barfoo&quot;</code>. It is the concatenation of <code>[&quot;bar&quot;,&quot;foo&quot;]</code> which is a permutation of <code>words</code>.<br />
-The substring starting at 9 is <code>&quot;foobar&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;]</code> which is a permutation of <code>words</code>.<br />
-The output order does not matter. Returning <code>[9,0]</code> is fine too.</p>
+The substring starting at 9 is <code>&quot;foobar&quot;</code>. It is the concatenation of <code>[&quot;foo&quot;,&quot;bar&quot;]</code> which is a permutation of <code>words</code>.</p>
 </div>
 
 <p><strong class="example">Example 2:</strong></p>

diff --git a/solution/2800-2899/2865.Beautiful Towers I/README_EN.md b/solution/2800-2899/2865.Beautiful Towers I/README_EN.md
@@ -6,65 +6,53 @@
 
 ## Description
 
-<p>You are given a <strong>0-indexed</strong> array <code>maxHeights</code> of <code>n</code> integers.</p>
+<p>You are given an array <code>heights</code> of <code>n</code> integers representing the number of bricks in <code>n</code> consecutive towers. Your task is to remove some bricks to form a <strong>mountain-shaped</strong> tower arrangement. In this arrangement, the tower heights are non-decreasing, reaching a maximum peak value with one or multiple consecutive towers and then non-increasing.</p>
 
-<p>You are tasked with building <code>n</code> towers in the coordinate line. The <code>i<sup>th</sup></code> tower is built at coordinate <code>i</code> and has a height of <code>heights[i]</code>.</p>
+<p>Return the <strong>maximum possible sum</strong> of heights of a mountain-shaped tower arrangement.</p>
 
-<p>A configuration of towers is <strong>beautiful</strong> if the following conditions hold:</p>
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
 
-<ol>
-	<li><code>1 &lt;= heights[i] &lt;= maxHeights[i]</code></li>
-	<li><code>heights</code> is a <strong>mountain</strong> array.</li>
-</ol>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">heights = [5,3,4,1,1]</span></p>
 
-<p>Array <code>heights</code> is a <strong>mountain</strong> if there exists an index <code>i</code> such that:</p>
+<p><strong>Output:</strong> <span class="example-io">13</span></p>
 
-<ul>
-	<li>For all <code>0 &lt; j &lt;= i</code>, <code>heights[j - 1] &lt;= heights[j]</code></li>
-	<li>For all <code>i &lt;= k &lt; n - 1</code>, <code>heights[k + 1] &lt;= heights[k]</code></li>
-</ul>
+<p><strong>Explanation:</strong></p>
 
-<p>Return <em>the <strong>maximum possible sum of heights</strong> of a beautiful configuration of towers</em>.</p>
+<p>We remove some bricks to make <code>heights =&nbsp;[5,3,3,1,1]</code>, the peak is at index 0.</p>
+</div>
 
-<p>&nbsp;</p>
-<p><strong class="example">Example 1:</strong></p>
+<p><strong class="example">Example 2:</strong></p>
 
-<pre>
-<strong>Input:</strong> maxHeights = [5,3,4,1,1]
-<strong>Output:</strong> 13
-<strong>Explanation:</strong> One beautiful configuration with a maximum sum is heights = [5,3,3,1,1]. This configuration is beautiful since:
-- 1 &lt;= heights[i] &lt;= maxHeights[i]  
-- heights is a mountain of peak i = 0.
-It can be shown that there exists no other beautiful configuration with a sum of heights greater than 13.</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">heights = [6,5,3,9,2,7]</span></p>
 
-<p><strong class="example">Example 2:</strong></p>
+<p><strong>Output:</strong> <span class="example-io">22</span></p>
+
+<p><strong>Explanation:</strong></p>
 
-<pre>
-<strong>Input:</strong> maxHeights = [6,5,3,9,2,7]
-<strong>Output:</strong> 22
-<strong>Explanation:</strong> One beautiful configuration with a maximum sum is heights = [3,3,3,9,2,2]. This configuration is beautiful since:
-- 1 &lt;= heights[i] &lt;= maxHeights[i]
-- heights is a mountain of peak i = 3.
-It can be shown that there exists no other beautiful configuration with a sum of heights greater than 22.</pre>
+<p>We remove some bricks to make <code>heights =&nbsp;[3,3,3,9,2,2]</code>, the peak is at index 3.</p>
+</div>
 
 <p><strong class="example">Example 3:</strong></p>
 
-<pre>
-<strong>Input:</strong> maxHeights = [3,2,5,5,2,3]
-<strong>Output:</strong> 18
-<strong>Explanation:</strong> One beautiful configuration with a maximum sum is heights = [2,2,5,5,2,2]. This configuration is beautiful since:
-- 1 &lt;= heights[i] &lt;= maxHeights[i]
-- heights is a mountain of peak i = 2. 
-Note that, for this configuration, i = 3 can also be considered a peak.
-It can be shown that there exists no other beautiful configuration with a sum of heights greater than 18.
-</pre>
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">heights = [3,2,5,5,2,3]</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">18</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>We remove some bricks to make <code>heights = [2,2,5,5,2,2]</code>, the peak is at index 2 or 3.</p>
+</div>
 
 <p>&nbsp;</p>
 <p><strong>Constraints:</strong></p>
 
 <ul>
-	<li><code>1 &lt;= n == maxHeights &lt;= 10<sup>3</sup></code></li>
-	<li><code>1 &lt;= maxHeights[i] &lt;= 10<sup>9</sup></code></li>
+	<li><code>1 &lt;= n == heights &lt;= 10<sup>3</sup></code></li>
+	<li><code>1 &lt;= heights[i] &lt;= 10<sup>9</sup></code></li>
 </ul>
 
 ## Solutions

diff --git a/solution/3100-3199/3120.Count the Number of Special Characters I/README.md b/solution/3100-3199/3120.Count the Number of Special Characters I/README.md
@@ -0,0 +1,86 @@
+# [3120. 统计特殊字母的数量 I](https://leetcode.cn/problems/count-the-number-of-special-characters-i)
+
+[English Version](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个字符串 <code>word</code>。如果 <code>word</code> 中同时存在某个字母的小写形式和大写形式，则称这个字母为 <strong>特殊字母</strong> 。</p>
+
+<p>返回 <code>word</code> 中<strong> </strong><strong>特殊字母 </strong>的数量。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "aaAbcBC"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">3</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><code>word</code> 中的特殊字母是 <code>'a'</code>、<code>'b'</code> 和 <code>'c'</code>。</p>
+</div>
+
+<p><strong class="example">示例 2:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "abc"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">0</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><code>word</code> 中不存在大小写形式同时出现的字母。</p>
+</div>
+
+<p><strong class="example">示例 3:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "abBCab"</span></p>
+
+<p><strong>输出：</strong>1</p>
+
+<p><strong>解释：</strong></p>
+
+<p><code>word</code> 中唯一的特殊字母是 <code>'b'</code>。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 50</code></li>
+	<li><code>word</code> 仅由小写和大写英文字母组成。</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->
diff --git a/solution/3100-3199/3120.Count the Number of Special Characters I/README_EN.md b/solution/3100-3199/3120.Count the Number of Special Characters I/README_EN.md
@@ -0,0 +1,82 @@
+# [3120. Count the Number of Special Characters I](https://leetcode.com/problems/count-the-number-of-special-characters-i)
+
+[中文文档](/solution/3100-3199/3120.Count%20the%20Number%20of%20Special%20Characters%20I/README.md)
+
+<!-- tags: -->
+
+## Description
+
+<p>You are given a string <code>word</code>. A letter is called <strong>special</strong> if it appears <strong>both</strong> in lowercase and uppercase in <code>word</code>.</p>
+
+<p>Return the number of<em> </em><strong>special</strong> letters in<em> </em><code>word</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">word = &quot;aaAbcBC&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">3</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The special characters in <code>word</code> are <code>&#39;a&#39;</code>, <code>&#39;b&#39;</code>, and <code>&#39;c&#39;</code>.</p>
+</div>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">word = &quot;abc&quot;</span></p>
+
+<p><strong>Output:</strong> <span class="example-io">0</span></p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>No character in <code>word</code> appears in uppercase.</p>
+</div>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong> <span class="example-io">word = &quot;abBCab&quot;</span></p>
+
+<p><strong>Output:</strong> 1</p>
+
+<p><strong>Explanation:</strong></p>
+
+<p>The only special character in <code>word</code> is <code>&#39;b&#39;</code>.</p>
+</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 50</code></li>
+	<li><code>word</code> consists of only lowercase and uppercase English letters.</li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->
diff --git a/solution/3100-3199/3121.Count the Number of Special Characters II/README.md b/solution/3100-3199/3121.Count the Number of Special Characters II/README.md
@@ -0,0 +1,86 @@
+# [3121. 统计特殊字母的数量 II](https://leetcode.cn/problems/count-the-number-of-special-characters-ii)
+
+[English Version](/solution/3100-3199/3121.Count%20the%20Number%20of%20Special%20Characters%20II/README_EN.md)
+
+<!-- tags: -->
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个字符串 <code>word</code>。如果 <code>word</code> 中同时出现某个字母 <code>c</code> 的小写形式和大写形式，并且<strong> 每个 </strong>小写形式的 <code>c</code> 都出现在第一个大写形式的 <code>c</code> 之前，则称字母 <code>c</code> 是一个 <strong>特殊字母</strong> 。</p>
+
+<p>返回 <code>word</code> 中 <strong>特殊字母</strong> 的数量。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "aaAbcBC"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">3</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p>特殊字母是 <code>'a'</code>、<code>'b'</code> 和 <code>'c'</code>。</p>
+</div>
+
+<p><strong class="example">示例 2:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "abc"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">0</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><code>word</code> 中不存在特殊字母。</p>
+</div>
+
+<p><strong class="example">示例 3:</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">word = "AbBCab"</span></p>
+
+<p><strong>输出：</strong><span class="example-io">0</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><code>word</code> 中不存在特殊字母。</p>
+</div>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 2 * 10<sup>5</sup></code></li>
+	<li><code>word</code> 仅由小写和大写英文字母组成。</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->