[프로그래머스] 모의고사

brute_force_search_01.js

// solution 1
function solution(answers) {
    
    const submit = ["12345", "21232425", "3311224455"];
    
    function cnt(submit) {
        const A_LENGTH = answers.length;
        const S_LENGTH = submit.length;
        
        if(A_LENGTH > S_LENGTH){
            submit = submit.repeat(Math.ceil(A_LENGTH/S_LENGTH));
        }

        submit = submit.substring(0, A_LENGTH)
                       .split('');
        
        let cnt = 0;
        
        submit.forEach((el, index) => {
            if(el == answers[index]){
                cnt++;
            }
        });
                     
        return cnt;
    }
    
    let temp = [cnt(submit[0]), cnt(submit[1]), cnt(submit[2])];
    let answer = [];
    const MAX = Math.max(...temp);
    
    temp.forEach((el, index) => {
        if(el == MAX)
            answer.push(index + 1);
    });
    
    return answer;
}

brute_force_search_02.js

// solution 2
function solution(answers) {
    
    const submit = ["12345", "21232425", "3311224455"];
    const temp = [];
    
    for(let i of submit){
        const LENGTH = i.length;
        let x = answers.filter((el, index) => el == i[index%LENGTH])
                       .length;
        temp.push(x); 
    }
    
    const MAX = Math.max(...temp);
    const answer = [];
    
    temp.forEach((el, index) => {
        if(el == MAX)
            answer.push(index + 1);
    })
    
    return answer;
}