[programmers] 폰켓몬 / C++

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

프로그래머스

 

#include <vector>
#include <set>
#include <iostream>

using namespace std;

set <int> pokemon;

int solution(vector<int> nums)
{
    int answer = 0;
    int N = nums.size(); // 1 - 10000
    
    for(int i=0; i<nums.size(); i++)
    {
        pokemon.insert(nums[i]);
    }
    
    /*
    set<int>::iterator iter;
    
    for(iter = pokemon.begin(); iter != pokemon.end(); iter++)
    {
        cout << "*iter: " << *iter << "\n";
    }
    */
    
    if(pokemon.size() > N/2) answer = N/2;
    else answer = pokemon.size();
    
    return answer;
}

 

set 컨테이너를 이용해서 중복없이 폰켓몬들의 번호를 저장해주었다