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:
小墨
2022-03-27 18:52:06 +08:00
parent 4a83e940d3
commit 44cb2b9989
3970 changed files with 620 additions and 621 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
算法题（国外版）/n-repeated-element-in-size-2n-array.html Normal file
View File

@@ -0,0 +1,30 @@
<p>You are given an integer array <code>nums</code> with the following properties:</p>
<ul>
<li><code>nums.length == 2 * n</code>.</li>
<li><code>nums</code> contains <code>n + 1</code> <strong>unique</strong> elements.</li>
<li>Exactly one element of <code>nums</code> is repeated <code>n</code> times.</li>
</ul>
<p>Return <em>the element that is repeated </em><code>n</code><em> times</em>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<pre><strong>Input:</strong> nums = [1,2,3,3]
<strong>Output:</strong> 3
</pre><p><strong>Example 2:</strong></p>
<pre><strong>Input:</strong> nums = [2,1,2,5,3,2]
<strong>Output:</strong> 2
</pre><p><strong>Example 3:</strong></p>
<pre><strong>Input:</strong> nums = [5,1,5,2,5,3,5,4]
<strong>Output:</strong> 5
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>2 &lt;= n &lt;= 5000</code></li>
<li><code>nums.length == 2 * n</code></li>
<li><code>0 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
<li><code>nums</code> contains <code>n + 1</code> <strong>unique</strong> elements and one of them is repeated exactly <code>n</code> times.</li>
</ul>