[프로그래머스 - Python/JavaScript] Lv.1 폰켓몬

• 문제

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

프로그래머스

 

• 풀이

- Python

def solution(nums):
    answer = []
    lenNums = len(nums) // 2
    while lenNums != len(answer):
        if len(answer) > 0:
            if len(nums) == 0:
                break
            elif nums[0] not in answer:
                answer.append(nums[0])
            nums.remove(nums[0])
        else:
            answer.append(nums[0])
            nums.remove(nums[0])

    return len(answer)

 

def solution(ls):
    return min(len(ls)/2, len(set(ls)))

ㅋㅋ 진짜 ㅋㅋㅋ ㅠ

파이썬은 이렇게 쓰라고 만들어진 것 같은데...  

 

 

 

 

- JavaScript

function solution(nums) {
    
    let set = new Set(nums);
    return [...set].length !== nums.length / 2 ? 
        ([...set].length > nums.length / 2 ? 
        nums.length / 2 : [...set].length) : nums.length / 2;
}