https://programmers.co.kr/learn/courses/30/lessons/42840?language=javascript
패턴대로 완전탐색을 돌리면 풀리는 문제이다.
function solution(answers) {
var answer = [];
let students = [0,0,0];
let pattern = [
[1,2,3,4,5],
[2,1,2,3,2,4,2,5],
[3,3,1,1,2,2,4,4,5,5]
];
for(let answer_index=0; answer_index<answers.length; ++answer_index){
for(let student_index=0;student_index<students.length;student_index++){
if( answers[answer_index] === pattern[student_index][ answer_index%(pattern[student_index].length)] ){
students[student_index]++;
}
}
}
for(let student=0; student<students.length; student++){
if(students[student]===Math.max.apply(null, students)){
answer.push(student+1);
}
}
return answer;
}
'개발 > 알고리즘' 카테고리의 다른 글
[Programmers] 2016 (0) | 2020.08.30 |
---|---|
[Programmers] k번째수 (0) | 2020.08.30 |
[Programmers] 완주하지 못한 선수 (0) | 2020.08.29 |
[Programmers] 크레인 인형뽑기 (0) | 2020.08.29 |
[Javascript] 최소공배수 문제 (0) | 2019.12.10 |