[코드] 2

1. 포켓몬

프로그래머스

function solution(nums) {
    const maxNums = Array.from(new Set(nums))
    return Math.min(nums.length / 2, maxNums.length);
}

 

2. 모의고사

프로그래머스

function solution(answers) {
    let answer = [];
    
    const std1 = [1, 2, 3, 4, 5];
    const std2 = [2, 1, 2, 3, 2, 4, 2, 5];
    const std3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5];
    
    let cnt = [0, 0, 0];
    
    for (let i=0; i < answers.length; i++) {
        if (answers[i] === std1[i % std1.length]) cnt[0]++;
        if (answers[i] === std2[i % std2.length]) cnt[1]++;
        if (answers[i] === std3[i % std3.length]) cnt[2]++;
    } 
    
    const maxScore = Math.max(cnt[0], cnt[1], cnt[2]);
    // console.log(maxScore);
    
    for (let i=0; i < cnt.length; i++) {
        if (cnt[i] === maxScore) answer.push(i + 1);
    }
    
    return answer;
}