feat: add weekly contest 383

solution/3000-3099/3027.Find the Number of Ways to Place People II/README.md

@@ -35,7 +35,7 @@
 
 <p><strong class="example">示例 2：</strong></p>
 
-<p><strong class="example"><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images//1706880313-YelabI-example2.jpeg"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images//1706880313-YelabI-example2.jpeg" style="width: 900px; height: 250px;" /></a></strong></p>
+<p><strong class="example"><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images/1706880313-YelabI-example2.jpeg"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images/1706880313-YelabI-example2.jpeg" style="width: 900px; height: 250px;" /></a></strong></p>
 
 <pre>
 <b>输入：</b>points = [[6,2],[4,4],[2,6]]
@@ -48,7 +48,7 @@
 
 <p><strong class="example">示例 3：</strong></p>
 
-<p><strong class="example"><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images//1706880311-mtPGYC-example3.jpeg"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images//1706880311-mtPGYC-example3.jpeg" style="width: 911px; height: 250px;" /></a></strong></p>
+<p><strong class="example"><a href="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images/1706880311-mtPGYC-example3.jpeg"><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3000-3099/3027.Find%20the%20Number%20of%20Ways%20to%20Place%20People%20II/images/1706880311-mtPGYC-example3.jpeg" style="width: 911px; height: 250px;" /></a></strong></p>
 
 <pre>
 <b>输入：</b>points = [[3,1],[1,3],[1,1]]

solution/3000-3099/3028.Ant on the Boundary/README.md

@@ -0,0 +1,86 @@
+# [3028. 边界上的蚂蚁](https://leetcode.cn/problems/ant-on-the-boundary)
+
+[English Version](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>边界上有一只蚂蚁，它有时向 <strong>左 </strong>走，有时向 <strong>右 </strong>走。</p>
+
+<p>给你一个 <strong>非零</strong> 整数数组 <code>nums</code> 。蚂蚁会按顺序读取 <code>nums</code> 中的元素，从第一个元素开始直到结束。每一步，蚂蚁会根据当前元素的值移动：</p>
+
+<ul>
+	<li>如果 <code>nums[i] &lt; 0</code> ，向 <strong>左</strong> 移动<!-- notionvc: 55fee232-4fc9-445f-952a-f1b979415864 --> <code>-nums[i]</code>单位。</li>
+	<li>如果 <code>nums[i] &gt; 0</code> ，向 <strong>右</strong> 移动 <code>nums[i]</code>单位。</li>
+</ul>
+
+<p>返回蚂蚁 <strong>返回 </strong>到边界上的次数。</p>
+
+<p><strong>注意：</strong></p>
+
+<ul>
+	<li>边界两侧有无限的空间。</li>
+	<li>只有在蚂蚁移动了 <code>|nums[i]|</code> 单位后才检查它是否位于边界上。换句话说，如果蚂蚁只是在移动过程中穿过了边界，则不会计算在内。<!-- notionvc: 5ff95338-8634-4d02-a085-1e83c0be6fcd --></li>
+</ul>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [2,3,-5]
+<strong>输出：</strong>1
+<strong>解释：</strong>第 1 步后，蚂蚁距边界右侧 2 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+第 2 步后，蚂蚁距边界右侧 5 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+第 3 步后，蚂蚁位于边界上。
+所以答案是 1 。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [3,2,-3,-4]
+<strong>输出：</strong>0
+<strong>解释：</strong>第 1 步后，蚂蚁距边界右侧 3 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+第 2 步后，蚂蚁距边界右侧 5 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+第 3 步后，蚂蚁距边界右侧 2 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+第 4 步后，蚂蚁距边界左侧 2 单位远<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->。
+蚂蚁从未返回到边界上，所以答案是 0 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
+	<li><code>nums[i] != 0</code></li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3028.Ant on the Boundary/README_EN.md

@@ -0,0 +1,82 @@
+# [3028. Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary)
+
+[中文文档](/solution/3000-3099/3028.Ant%20on%20the%20Boundary/README.md)
+
+## Description
+
+<p>An ant is on a boundary. It sometimes goes <strong>left</strong> and sometimes <strong>right</strong>.</p>
+
+<p>You are given an array of <strong>non-zero</strong> integers <code>nums</code>. The ant starts reading <code>nums</code> from the first element of it to its end. At each step, it moves according to the value of the current element:</p>
+
+<ul>
+	<li>If <code>nums[i] &lt; 0</code>, it moves <strong>left</strong> by<!-- notionvc: 55fee232-4fc9-445f-952a-f1b979415864 --> <code>-nums[i]</code> units.</li>
+	<li>If <code>nums[i] &gt; 0</code>, it moves <strong>right</strong> by <code>nums[i]</code> units.</li>
+</ul>
+
+<p>Return <em>the number of times the ant <strong>returns</strong> to the boundary.</em></p>
+
+<p><strong>Notes:</strong></p>
+
+<ul>
+	<li>There is an infinite space on both sides of the boundary.</li>
+	<li>We check whether the ant is on the boundary only after it has moved <code>|nums[i]|</code> units. In other words, if the ant crosses the boundary during its movement, it does not count.<!-- notionvc: 5ff95338-8634-4d02-a085-1e83c0be6fcd --></li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2,3,-5]
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> After the first step, the ant is 2 steps to the right of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+After the second step, the ant is 5 steps to the right of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+After the third step, the ant is on the boundary.
+So the answer is 1.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [3,2,-3,-4]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> After the first step, the ant is 3 steps to the right of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+After the second step, the ant is 5 steps to the right of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+After the third step, the ant is 2 steps to the right of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+After the fourth step, the ant is 2 steps to the left of the boundary<!-- notionvc: 61ace51c-559f-4bc6-800f-0a0db2540433 -->.
+The ant never returned to the boundary, so the answer is 0.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
+	<li><code>nums[i] != 0</code></li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/README.md

@@ -0,0 +1,90 @@
+# [3029. 将单词恢复初始状态所需的最短时间 I](https://leetcode.cn/problems/minimum-time-to-revert-word-to-initial-state-i)
+
+[English Version](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>给你一个下标从 <strong>0</strong> 开始的字符串 <code>word</code> 和一个整数 <code>k</code> 。</p>
+
+<p>在每一秒，你必须执行以下操作：</p>
+
+<ul>
+	<li>移除 <code>word</code> 的前 <code>k</code> 个字符。</li>
+	<li>在 <code>word</code> 的末尾添加 <code>k</code> 个任意字符。</li>
+</ul>
+
+<p><strong>注意 </strong>添加的字符不必和移除的字符相同。但是，必须在每一秒钟都执行 <strong>两种 </strong>操作。</p>
+
+<p>返回将 <code>word</code> 恢复到其 <strong>初始 </strong>状态所需的 <strong>最短 </strong>时间（该时间必须大于零）。</p>
+
+<p>&nbsp;</p>
+
+<p><strong class="example">示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>word = "abacaba", k = 3
+<strong>输出：</strong>2
+<strong>解释：</strong>
+第 1 秒，移除 word 的前缀 "aba"，并在末尾添加 "bac" 。因此，word 变为 "cababac"。
+第 2 秒，移除 word 的前缀 "cab"，并在末尾添加 "aba" 。因此，word 变为 "abacaba" 并恢复到始状态。
+可以证明，2 秒是 word 恢复到其初始状态所需的最短时间。
+</pre>
+
+<p><strong class="example">示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>word = "abacaba", k = 4
+<strong>输出：</strong>1
+<strong>解释：
+</strong>第 1 秒，移除 word 的前缀 "abac"，并在末尾添加 "caba" 。因此，word 变为 "abacaba" 并恢复到初始状态。
+可以证明，1 秒是 word 恢复到其初始状态所需的最短时间。
+</pre>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<pre>
+<strong>输入：</strong>word = "abcbabcd", k = 2
+<strong>输出：</strong>4
+<strong>解释：</strong>
+每一秒，我们都移除 word 的前 2 个字符，并在 word 末尾添加相同的字符。
+4 秒后，word 变为 "abcbabcd" 并恢复到初始状态。
+可以证明，4 秒是 word 恢复到其初始状态所需的最短时间。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 50</code></li>
+	<li><code>1 &lt;= k &lt;= word.length</code></li>
+	<li><code>word</code>仅由小写英文字母组成。</li>
+</ul>
+
+## 解法
+
+### 方法一
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->

solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/README_EN.md

@@ -0,0 +1,83 @@
+# [3029. Minimum Time to Revert Word to Initial State I](https://leetcode.com/problems/minimum-time-to-revert-word-to-initial-state-i)
+
+[中文文档](/solution/3000-3099/3029.Minimum%20Time%20to%20Revert%20Word%20to%20Initial%20State%20I/README.md)
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> string <code>word</code> and an integer <code>k</code>.</p>
+
+<p>At every second, you must perform the following operations:</p>
+
+<ul>
+	<li>Remove the first <code>k</code> characters of <code>word</code>.</li>
+	<li>Add any <code>k</code> characters to the end of <code>word</code>.</li>
+</ul>
+
+<p><strong>Note</strong> that you do not necessarily need to add the same characters that you removed. However, you must perform <strong>both</strong> operations at every second.</p>
+
+<p>Return <em>the <strong>minimum</strong> time greater than zero required for</em> <code>word</code> <em>to revert to its <strong>initial</strong> state</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> word = &quot;abacaba&quot;, k = 3
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> At the 1st second, we remove characters &quot;aba&quot; from the prefix of word, and add characters &quot;bac&quot; to the end of word. Thus, word becomes equal to &quot;cababac&quot;.
+At the 2nd second, we remove characters &quot;cab&quot; from the prefix of word, and add &quot;aba&quot; to the end of word. Thus, word becomes equal to &quot;abacaba&quot; and reverts to its initial state.
+It can be shown that 2 seconds is the minimum time greater than zero required for word to revert to its initial state.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> word = &quot;abacaba&quot;, k = 4
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> At the 1st second, we remove characters &quot;abac&quot; from the prefix of word, and add characters &quot;caba&quot; to the end of word. Thus, word becomes equal to &quot;abacaba&quot; and reverts to its initial state.
+It can be shown that 1 second is the minimum time greater than zero required for word to revert to its initial state.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> word = &quot;abcbabcd&quot;, k = 2
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> At every second, we will remove the first 2 characters of word, and add the same characters to the end of word.
+After 4 seconds, word becomes equal to &quot;abcbabcd&quot; and reverts to its initial state.
+It can be shown that 4 seconds is the minimum time greater than zero required for word to revert to its initial state.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= word.length &lt;= 50 </code></li>
+	<li><code>1 &lt;= k &lt;= word.length</code></li>
+	<li><code>word</code> consists only of lowercase English letters.</li>
+</ul>
+
+## Solutions
+
+### Solution 1
+
+<!-- tabs:start -->
+
+```python
+
+```
+
+```java
+
+```
+
+```cpp
+
+```
+
+```go
+
+```
+
+<!-- tabs:end -->
+
+<!-- end -->