1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
import java.util.Arrays;
import java.util.Set;

public class Solution {
    public int solution(int[] nums) {
        int getMaxValue = nums.length / 2;
        int answer = 0;

//       int[] distinct = Arrays.stream(nums)
//           .distinct()
//           .toArray();

//       int deduplication = distinct.length;

        Set<Integer> distinct = new HashSet<>();

        for (int num : nums) {
            distinct.add(num);
        }
        int deduplication = distinct.size();

        if (getMaxValue > deduplication) {
            answer = getMaxValue;
        }

        else { answer = deduplication; }

        return answer;

    }

}