[프로그래머스 Lv1] 폰켓몬(python, 해시)

[문제]

[풀이]

def solution(nums):
    answer = 0
    not_duplication = []
    my_pocketmon = len(nums) // 2

    for i in nums:
        if i not in not_duplication:
            not_duplication.append(i)

    return min(my_pocketmon, len(not_duplication))

[링크]

https://school.programmers.co.kr/learn/courses/30/lessons/1845

프로그래머스