[프로그래머스/Java] 폰켓몬

Link

프로그래머스 폰켓몬 링크

Solved process

1. Check the max number to pick
2. Deduplication using 'HastSet'
3. Comparing

Code

import java.util.HashSet;

class Solution {
    public int solution(int[] nums) {
        int pick = (nums.length)/2; //max number
        System.out.println(pick);

        //deduplication
        HashSet<Integer> set = new HashSet<>();

        for(int num: nums){
            set.add(num);
        }

        //return ans
        if (set.size() >= pick){
            return pick;
        } else {
            return set.size();
        }
    }
}