프로그래머스 - 폰켓몬

part2. 폰켓몬

java

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

    class Solution {
        public int solution(int[] nums) {
            int limitCnt = nums.length / 2;
            Set<Integer> tempSet = new HashSet<>(limitCnt);
            
            for (int num : nums) {
                tempSet.add(num);
                if (tempSet.size() == limitCnt) {
                    break;
                }
            }
            
            return Math.min(tempSet.size(), limitCnt);
        }
    }   

---

---