LeetCode in Kotlin
961. 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 elements.- 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.
Solution
class Solution {
fun repeatedNTimes(nums: IntArray): Int {
val hs: HashSet<Int> = HashSet()
for (x in nums) {
if (!hs.contains(x)) {
hs.add(x)
} else {
return x
}
}
return 1
}
}