(프로그래머스) 폰켓몬

문제 링크

https://programmers.co.kr/learn/courses/30/lessons/1845?language=javascript

Javascript

function solution(nums) {
  const max = nums.length / 2
  const noDup = [...new Set(nums)].length;
  return max < noDup ? max : noDup
}