Programmers / 폰켓몬

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19

import java.util.Set;
import java.util.HashSet;

class Solution {
    public int solution(int[] nums) {
        Set<Integer> set = new HashSet<Integer>();

        // Create existing phonecatmon set
        for (int i = 0; i < nums.length; i++) {
            set.add(nums[i]);
        }
        
        // Return
        if (set.size() > (nums.length / 2)) {
            return nums.length / 2;
        }
        return set.size();
    }
}