[LeetCode] Problem 961 - N-Repeated Element in Size 2N Array

In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.

Return the element repeated N times.

Example

No.1

Input: [1,2,3,3]

Output: 3

No.2

Input: [2,1,2,5,3,2]

Output: 2

No.3

Input: [5,1,5,2,5,3,5,4]

Output: 5

Note

4 <= A.length <= 10000
0 <= A[i] < 10000
A.length is even

Code

1
2
3
4
5
6
7
8
9
10
public int repeatedNTimes(int[] A) {
for (int i = 1; i <= 3; i++) {
for (int j = 0; j < A.length - i; j++) {
if (A[j] == A[j + i])
return A[j];
}
}

throw null;
}