chore: add new lc problems: No.2113+

Add new lc problems: No.2113~2122

Author: yanglbme

solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README.md

@@ -0,0 +1,109 @@
+# [2113. Elements in Array After Removing and Replacing Elements](https://leetcode-cn.com/problems/elements-in-array-after-removing-and-replacing-elements)
+
+[English Version](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. Initially on minute <code>0</code>, the array is unchanged. Every minute, the <strong>leftmost</strong> element in <code>nums</code> is removed until no elements remain. Then, every minute, one element is appended to the <strong>end</strong> of <code>nums</code>, in the order they were removed in, until the original array is restored. This process repeats indefinitely.</p>
+
+<ul>
+	<li>For example, the array <code>[0,1,2]</code> would change as follows: <code>[0,1,2] &rarr; [1,2] &rarr; [2] &rarr; [] &rarr; [0] &rarr; [0,1] &rarr; [0,1,2] &rarr; [1,2] &rarr; [2] &rarr; [] &rarr; [0] &rarr; [0,1] &rarr; [0,1,2] &rarr; ...</code></li>
+</ul>
+
+<p>You are also given a 2D integer array <code>queries</code> of size <code>n</code> where <code>queries[j] = [time<sub>j</sub>, index<sub>j</sub>]</code>. The answer to the <code>j<sup>th</sup></code> query is:</p>
+
+<ul>
+	<li><code>nums[index<sub>j</sub>]</code> if <code>index<sub>j</sub> &lt; nums.length</code> at minute <code>time<sub>j</sub></code></li>
+	<li><code>-1</code> if <code>index<sub>j</sub> &gt;= nums.length</code> at minute <code>time<sub>j</sub></code></li>
+</ul>
+
+<p>Return <em>an integer array <code>ans</code> of size </em><code>n</code> <em>where </em><code>ans[j]</code><em> is the answer to the </em><code>j<sup>th</sup></code><em> query</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1,2], queries = [[0,2],[2,0],[3,2],[5,0]]
+<strong>Output:</strong> [2,2,-1,0]
+<strong>Explanation:</strong>
+Minute 0: [0,1,2] - All elements are in the nums.
+Minute 1: [1,2]   - The leftmost element, 0, is removed.
+Minute 2: [2]     - The leftmost element, 1, is removed.
+Minute 3: []      - The leftmost element, 2, is removed.
+Minute 4: [0]     - 0 is added to the end of nums.
+Minute 5: [0,1]   - 1 is added to the end of nums.
+
+At minute 0, nums[2] is 2.
+At minute 2, nums[0] is 2.
+At minute 3, nums[2] does not exist.
+At minute 5, nums[0] is 0.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2], queries = [[0,0],[1,0],[2,0],[3,0]]
+<strong>Output:</strong> [2,-1,2,-1]
+Minute 0: [2] - All elements are in the nums.
+Minute 1: []  - The leftmost element, 2, is removed.
+Minute 2: [2] - 2 is added to the end of nums.
+Minute 3: []  - The leftmost element, 2, is removed.
+
+At minute 0, nums[0] is 2.
+At minute 1, nums[0] does not exist.
+At minute 2, nums[0] is 2.
+At minute 3, nums[0] does not exist.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
+	<li><code>n == queries.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>queries[j].length == 2</code></li>
+	<li><code>0 &lt;= time<sub>j</sub> &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= index<sub>j</sub> &lt; nums.length</code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2100-2199/2113.Elements in Array After Removing and Replacing Elements/README_EN.md

@@ -0,0 +1,99 @@
+# [2113. Elements in Array After Removing and Replacing Elements](https://leetcode.com/problems/elements-in-array-after-removing-and-replacing-elements)
+
+[中文文档](/solution/2100-2199/2113.Elements%20in%20Array%20After%20Removing%20and%20Replacing%20Elements/README.md)
+
+## Description
+
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. Initially on minute <code>0</code>, the array is unchanged. Every minute, the <strong>leftmost</strong> element in <code>nums</code> is removed until no elements remain. Then, every minute, one element is appended to the <strong>end</strong> of <code>nums</code>, in the order they were removed in, until the original array is restored. This process repeats indefinitely.</p>
+
+<ul>
+	<li>For example, the array <code>[0,1,2]</code> would change as follows: <code>[0,1,2] &rarr; [1,2] &rarr; [2] &rarr; [] &rarr; [0] &rarr; [0,1] &rarr; [0,1,2] &rarr; [1,2] &rarr; [2] &rarr; [] &rarr; [0] &rarr; [0,1] &rarr; [0,1,2] &rarr; ...</code></li>
+</ul>
+
+<p>You are also given a 2D integer array <code>queries</code> of size <code>n</code> where <code>queries[j] = [time<sub>j</sub>, index<sub>j</sub>]</code>. The answer to the <code>j<sup>th</sup></code> query is:</p>
+
+<ul>
+	<li><code>nums[index<sub>j</sub>]</code> if <code>index<sub>j</sub> &lt; nums.length</code> at minute <code>time<sub>j</sub></code></li>
+	<li><code>-1</code> if <code>index<sub>j</sub> &gt;= nums.length</code> at minute <code>time<sub>j</sub></code></li>
+</ul>
+
+<p>Return <em>an integer array <code>ans</code> of size </em><code>n</code> <em>where </em><code>ans[j]</code><em> is the answer to the </em><code>j<sup>th</sup></code><em> query</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0,1,2], queries = [[0,2],[2,0],[3,2],[5,0]]
+<strong>Output:</strong> [2,2,-1,0]
+<strong>Explanation:</strong>
+Minute 0: [0,1,2] - All elements are in the nums.
+Minute 1: [1,2]   - The leftmost element, 0, is removed.
+Minute 2: [2]     - The leftmost element, 1, is removed.
+Minute 3: []      - The leftmost element, 2, is removed.
+Minute 4: [0]     - 0 is added to the end of nums.
+Minute 5: [0,1]   - 1 is added to the end of nums.
+
+At minute 0, nums[2] is 2.
+At minute 2, nums[0] is 2.
+At minute 3, nums[2] does not exist.
+At minute 5, nums[0] is 0.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [2], queries = [[0,0],[1,0],[2,0],[3,0]]
+<strong>Output:</strong> [2,-1,2,-1]
+Minute 0: [2] - All elements are in the nums.
+Minute 1: []  - The leftmost element, 2, is removed.
+Minute 2: [2] - 2 is added to the end of nums.
+Minute 3: []  - The leftmost element, 2, is removed.
+
+At minute 0, nums[0] is 2.
+At minute 1, nums[0] does not exist.
+At minute 2, nums[0] is 2.
+At minute 3, nums[0] does not exist.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 100</code></li>
+	<li><code>n == queries.length</code></li>
+	<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
+	<li><code>queries[j].length == 2</code></li>
+	<li><code>0 &lt;= time<sub>j</sub> &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= index<sub>j</sub> &lt; nums.length</code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/README.md

@@ -0,0 +1,84 @@
+# [2114. 句子中的最多单词数](https://leetcode-cn.com/problems/maximum-number-of-words-found-in-sentences)
+
+[English Version](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>一个 <strong>句子</strong>&nbsp;由一些 <strong>单词</strong>&nbsp;以及它们之间的单个空格组成，句子的开头和结尾不会有多余空格。</p>
+
+<p>给你一个字符串数组&nbsp;<code>sentences</code>&nbsp;，其中&nbsp;<code>sentences[i]</code>&nbsp;表示单个 <strong>句子</strong>&nbsp;。</p>
+
+<p>请你返回单个句子里 <strong>单词的最多数目</strong>&nbsp;。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><b>输入：</b>sentences = ["alice and bob love leetcode", "i think so too", <em><strong>"this is great thanks very much"</strong></em>]
+<b>输出：</b>6
+<b>解释：</b>
+- 第一个句子 "alice and bob love leetcode" 总共有 5 个单词。
+- 第二个句子 "i think so too" 总共有 4 个单词。
+- 第三个句子 "this is great thanks very much" 总共有 6 个单词。
+所以，单个句子中有最多单词数的是第三个句子，总共有 6 个单词。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><b>输入：</b>sentences = ["please wait", <em><strong>"continue to fight"</strong></em>, <em><strong>"continue to win"</strong></em>]
+<b>输出：</b>3
+<b>解释：</b>可能有多个句子有相同单词数。
+这个例子中，第二个句子和第三个句子（加粗斜体）有相同数目的单词数。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= sentences.length &lt;= 100</code></li>
+	<li><code>1 &lt;= sentences[i].length &lt;= 100</code></li>
+	<li><code>sentences[i]</code>&nbsp;只包含小写英文字母和&nbsp;<code>' '</code>&nbsp;。</li>
+	<li><code>sentences[i]</code>&nbsp;的开头和结尾都没有空格。</li>
+	<li><code>sentences[i]</code>&nbsp;中所有单词由单个空格隔开。</li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **Python3**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```python
+
+```
+
+### **Java**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```java
+
+```
+
+### **TypeScript**
+
+<!-- 这里可写当前语言的特殊实现逻辑 -->
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2100-2199/2114.Maximum Number of Words Found in Sentences/README_EN.md

@@ -0,0 +1,74 @@
+# [2114. Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences)
+
+[中文文档](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md)
+
+## Description
+
+<p>A <strong>sentence</strong> is a list of <strong>words</strong> that are separated by a single space&nbsp;with no leading or trailing spaces.</p>
+
+<p>You are given an array of strings <code>sentences</code>, where each <code>sentences[i]</code> represents a single <strong>sentence</strong>.</p>
+
+<p>Return <em>the <strong>maximum number of words</strong> that appear in a single sentence</em>.</p>
+
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> sentences = [&quot;alice and bob love leetcode&quot;, &quot;i think so too&quot;, <u>&quot;this is great thanks very much&quot;</u>]
+<strong>Output:</strong> 6
+<strong>Explanation:</strong> 
+- The first sentence, &quot;alice and bob love leetcode&quot;, has 5 words in total.
+- The second sentence, i think so too&quot;, has 4 words in total.
+- The third sentence, &quot;this is great thanks very much&quot;, has 6 words in total.
+Thus, the maximum number of words in a single sentence comes from the third sentence, which has 6 words.
+</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> sentences = [&quot;please wait&quot;, <u>&quot;continue to fight&quot;</u>, <u>&quot;continue to win&quot;</u>]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> It is possible that multiple sentences contain the same number of words. 
+In this example, the second and third sentences (underlined) have the same number of words.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= sentences.length &lt;= 100</code></li>
+	<li><code>1 &lt;= sentences[i].length &lt;= 100</code></li>
+	<li><code>sentences[i]</code> consists only of lowercase English letters and <code>&#39; &#39;</code> only.</li>
+	<li><code>sentences[i]</code> does not have leading or trailing spaces.</li>
+	<li>All the words in <code>sentences[i]</code> are separated by a single space.</li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **Python3**
+
+```python
+
+```
+
+### **Java**
+
+```java
+
+```
+
+### **TypeScript**
+
+```ts
+
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->