1001. N-Repeated Element in Size 2N Array
2026/1/12小于 1 分钟约 259 字
1001. N-Repeated Element in Size 2N Array
难度: Easy
题目描述
You are given an integer array nums with the following properties:
nums.length == 2 * n.numscontainsn + 1unique values,nof which occur exactly once in the array.- Exactly one element of
numsis repeatedntimes.
Return the element that is repeated n times.
Example 1:
Input: nums = [1,2,3,3] Output: 3
Example 2:
Input: nums = [2,1,2,5,3,2] Output: 2
Example 3:
Input: nums = [5,1,5,2,5,3,5,4] Output: 5
Constraints:
2 <= n <= 5000nums.length == 2 * n0 <= nums[i] <= 104numscontainsn + 1unique elements and one of them is repeated exactlyntimes.
解题思路
代码实现
解决方案
java
class Solution {
public int repeatedNTimes(int[] nums) {
}
}