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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
leetcode-cn/problem (Chinese)/数组嵌套 [array-nesting].html
View File

@@ -6,7 +6,8 @@
<p><strong>示例&nbsp;1:</strong></p>
<pre><strong>输入:</strong> A = [5,4,0,3,1,6,2]
<pre>
<strong>输入:</strong> A = [5,4,0,3,1,6,2]
<strong>输出:</strong> 4
<strong>解释:</strong>
A[0] = 5, A[1] = 4, A[2] = 0, A[3] = 3, A[4] = 1, A[5] = 6, A[6] = 2.
@@ -19,8 +20,8 @@ S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0}
<p><strong>提示：</strong></p>
<ol>
<li><code>N</code>是<code>[1, 20,000]</code>之间的整数。</li>
<ul>
<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
<li><code>0 &lt;= nums[i] &lt; nums.length</code></li>
<li><code>A</code>中不含有重复的元素。</li>
<li><code>A</code>中的元素大小在<code>[0, N-1]</code>之间。</li>
</ol>
</ul>