coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-12 02:41:42 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

批量更新数据

Browse Source
This commit is contained in:
小墨
2025-01-09 20:29:41 +08:00
parent 04ecea043d
commit 48cdd06c2b
5053 changed files with 156164 additions and 135322 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
leetcode-cn/problem (Chinese)/ 字母与数字 [find-longest-subarray-lcci].html
View File

@@ -2,24 +2,24 @@
<p>返回该子数组，若存在多个最长子数组，返回左端点下标值最小的子数组。若不存在这样的数组，返回一个空数组。</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong>输入: </strong>["A","1","B","C","D","2","3","4","E","5","F","G","6","7","H","I","J","K","L","M"]
<strong>输入：</strong>["A","1","B","C","D","2","3","4","E","5","F","G","6","7","H","I","J","K","L","M"]
<strong>输出: </strong>["A","1","B","C","D","2","3","4","E","5","F","G","6","7"]
<strong>输出：</strong>["A","1","B","C","D","2","3","4","E","5","F","G","6","7"]
</pre>
<p><strong>示例 2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong>输入: </strong>["A","A"]
<strong>输入：</strong>["A","A"]
<strong>输出: </strong>[]
<strong>输出：</strong>[]
</pre>
<p><strong>提示：</strong></p>
<ul>
<li><code>array.length <= 100000</code></li>
<li><code>array.length &lt;= 100000</code></li>
</ul>