mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
39 lines
1.3 KiB
HTML
39 lines
1.3 KiB
HTML
<p>Given an array of integers <code>nums</code> containing <code>n + 1</code> integers where each integer is in the range <code>[1, n]</code> inclusive.</p>
|
|
|
|
<p>There is only <strong>one repeated number</strong> in <code>nums</code>, return <em>this repeated number</em>.</p>
|
|
|
|
<p>You must solve the problem <strong>without</strong> modifying the array <code>nums</code> and uses only constant extra space.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,3,4,2,2]
|
|
<strong>Output:</strong> 2
|
|
</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [3,1,3,4,2]
|
|
<strong>Output:</strong> 3
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= n <= 10<sup>5</sup></code></li>
|
|
<li><code>nums.length == n + 1</code></li>
|
|
<li><code>1 <= nums[i] <= n</code></li>
|
|
<li>All the integers in <code>nums</code> appear only <strong>once</strong> except for <strong>precisely one integer</strong> which appears <strong>two or more</strong> times.</li>
|
|
</ul>
|
|
|
|
<p> </p>
|
|
<p><b>Follow up:</b></p>
|
|
|
|
<ul>
|
|
<li>How can we prove that at least one duplicate number must exist in <code>nums</code>?</li>
|
|
<li>Can you solve the problem in linear runtime complexity?</li>
|
|
</ul>
|