Class Solution
java.lang.Object
g0901_1000.s0961_n_repeated_element_in_size_2n_array.Solution
961 - N-Repeated Element in Size 2N Array.<p>Easy</p>
<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><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [1,2,3,3]</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [2,1,2,5,3,2]</p>
<p><strong>Output:</strong> 2</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> nums = [5,1,5,2,5,3,5,4]</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>2 <= n <= 5000</code></li>
<li><code>nums.length == 2 * n</code></li>
<li><code>0 <= nums[i] <= 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>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
repeatedNTimes
public int repeatedNTimes(int[] nums)
-