feat: add weekly contest 380 (#2215)

Author: acbin

solution/3000-3099/3005.Count Elements With Maximum Frequency/README.md

@@ -0,0 +1,84 @@
+# [3005. 最大频率元素计数](https://leetcode.cn/problems/count-elements-with-maximum-frequency)
+
+[English Version](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个由 <strong>正整数 </strong>组成的数组 <code>nums</code> 。</p>
+
+<p>返回数组 <code>nums</code> 中所有具有 <strong>最大 </strong>频率的元素的 <strong>总频率 </strong>。</p>
+
+<p>元素的 <strong>频率 </strong>是指该元素在数组中出现的次数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,2,2,3,1,4]
+<strong>输出：</strong>4
+<strong>解释：</strong>元素 1 和 2 的频率为 2 ，是数组中的最大频率。
+因此具有最大频率的元素在数组中的数量是 4 。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [1,2,3,4,5]
+<strong>输出：</strong>5
+<strong>解释：</strong>数组中的所有元素的频率都为 1 ，是最大频率。
+因此具有最大频率的元素在数组中的数量是 5 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/3000-3099/3005.Count Elements With Maximum Frequency/README_EN.md

@@ -0,0 +1,74 @@
+# [3005. Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency)
+
+[中文文档](/solution/3000-3099/3005.Count%20Elements%20With%20Maximum%20Frequency/README.md)
+
+## Description
+
+<p>You are given an array <code>nums</code> consisting of <strong>positive</strong> integers.</p>
+
+<p>Return <em>the <strong>total frequencies</strong> of elements in</em><em> </em><code>nums</code>&nbsp;<em>such that those elements all have the <strong>maximum</strong> frequency</em>.</p>
+
+<p>The <strong>frequency</strong> of an element is the number of occurrences of that element in the array.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,2,3,1,4]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> The elements 1 and 2 have a frequency of 2 which is the maximum frequency in the array.
+So the number of elements in the array with maximum frequency is 4.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> All elements of the array have a frequency of 1 which is the maximum.
+So the number of elements in the array with maximum frequency is 5.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/3000-3099/3006.Find Beautiful Indices in the Given Array I/README.md

@@ -0,0 +1,100 @@
+# [3006. 找出数组中的美丽下标 I](https://leetcode.cn/problems/find-beautiful-indices-in-the-given-array-i)
+
+[English Version](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个下标从 <strong>0</strong> 开始的字符串 <code>s</code> 、字符串 <code>a</code> 、字符串 <code>b</code> 和一个整数 <code>k</code> 。</p>
+
+<p>如果下标 <code>i</code> 满足以下条件，则认为它是一个 <strong>美丽下标</strong>：</p>
+
+<ul>
+	<li><code>0 &lt;= i &lt;= s.length - a.length</code></li>
+	<li><code>s[i..(i + a.length - 1)] == a</code></li>
+	<li>存在下标 <code>j</code> 使得：
+	<ul>
+		<li><code>0 &lt;= j &lt;= s.length - b.length</code></li>
+		<li><code>s[j..(j + b.length - 1)] == b</code></li>
+		<li><code>|j - i| &lt;= k</code></li>
+	</ul>
+	</li>
+</ul>
+
+<p>以数组形式按<strong> 从小到大排序 </strong>返回美丽下标。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "isawsquirrelnearmysquirrelhouseohmy", a = "my", b = "squirrel", k = 15
+<strong>输出：</strong>[16,33]
+<strong>解释：</strong>存在 2 个美丽下标：[16,33]。
+- 下标 16 是美丽下标，因为 s[16..17] == "my" ，且存在下标 4 ，满足 s[4..11] == "squirrel" 且 |16 - 4| &lt;= 15 。
+- 下标 33 是美丽下标，因为 s[33..34] == "my" ，且存在下标 18 ，满足 s[18..25] == "squirrel" 且 |33 - 18| &lt;= 15 。
+因此返回 [16,33] 作为结果。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>s = "abcd", a = "a", b = "a", k = 4
+<strong>输出：</strong>[0]
+<strong>解释：</strong>存在 1 个美丽下标：[0]。
+- 下标 0 是美丽下标，因为 s[0..0] == "a" ，且存在下标 0 ，满足 s[0..0] == "a" 且 |0 - 0| &lt;= 4 。
+因此返回 [0] 作为结果。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= k &lt;= s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= a.length, b.length &lt;= 10</code></li>
+	<li><code>s</code>、<code>a</code>、和 <code>b</code> 只包含小写英文字母。</li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/3000-3099/3006.Find Beautiful Indices in the Given Array I/README_EN.md

@@ -0,0 +1,90 @@
+# [3006. Find Beautiful Indices in the Given Array I](https://leetcode.com/problems/find-beautiful-indices-in-the-given-array-i)
+
+[中文文档](/solution/3000-3099/3006.Find%20Beautiful%20Indices%20in%20the%20Given%20Array%20I/README.md)
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> string <code>s</code>, a string <code>a</code>, a string <code>b</code>, and an integer <code>k</code>.</p>
+
+<p>An index <code>i</code> is <strong>beautiful</strong> if:</p>
+
+<ul>
+	<li><code>0 &lt;= i &lt;= s.length - a.length</code></li>
+	<li><code>s[i..(i + a.length - 1)] == a</code></li>
+	<li>There exists an index <code>j</code> such that:
+	<ul>
+		<li><code>0 &lt;= j &lt;= s.length - b.length</code></li>
+		<li><code>s[j..(j + b.length - 1)] == b</code></li>
+		<li><code>|j - i| &lt;= k</code></li>
+	</ul>
+	</li>
+</ul>
+
+<p>Return <em>the array that contains beautiful indices in <strong>sorted order from smallest to largest</strong></em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;isawsquirrelnearmysquirrelhouseohmy&quot;, a = &quot;my&quot;, b = &quot;squirrel&quot;, k = 15
+<strong>Output:</strong> [16,33]
+<strong>Explanation:</strong> There are 2 beautiful indices: [16,33].
+- The index 16 is beautiful as s[16..17] == &quot;my&quot; and there exists an index 4 with s[4..11] == &quot;squirrel&quot; and |16 - 4| &lt;= 15.
+- The index 33 is beautiful as s[33..34] == &quot;my&quot; and there exists an index 18 with s[18..25] == &quot;squirrel&quot; and |33 - 18| &lt;= 15.
+Thus we return [16,33] as the result.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;abcd&quot;, a = &quot;a&quot;, b = &quot;a&quot;, k = 4
+<strong>Output:</strong> [0]
+<strong>Explanation:</strong> There is 1 beautiful index: [0].
+- The index 0 is beautiful as s[0..0] == &quot;a&quot; and there exists an index 0 with s[0..0] == &quot;a&quot; and |0 - 0| &lt;= 4.
+Thus we return [0] as the result.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= k &lt;= s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= a.length, b.length &lt;= 10</code></li>
+	<li><code>s</code>, <code>a</code>, and <code>b</code> contain only lowercase English letters.</li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **C++**
+
+```cpp
+
+```
+
+### **Go**
+
+```go
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->