수포자는 수학을 포기한 사람의 준말입니다. 수포자 삼인방은 모의고사에 수학 문제를 전부 찍으려 합니다. 수포자는 1번 문제부터 마지막 문제까지 다음과 같이 찍습니다.
1번 수포자가 찍는 방식: 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, ...2번 수포자가 찍는 방식: 2, 1, 2, 3, 2, 4, 2, 5, 2, 1, 2, 3, 2, 4, 2, 5, ...3번 수포자가 찍는 방식: 3, 3, 1, 1, 2, 2, 4, 4, 5, 5, 3, 3, 1, 1, 2, 2, 4, 4, 5, 5, ...
1번 문제부터 마지막 문제까지의 정답이 순서대로 들은 배열 answers가 주어졌을 때, 가장 많은 문제를 맞힌 사람이 누구인지 배열에 담아 return 하도록 solution 함수를 작성해주세요.
코드가 진짜 너~무 길어졌다... 반성해야겠...
function examinees(
examineesLength,
answersLength,
examineeOne,
examineeTwo,
examineeThree
) {
const maxExamineeLength = parseInt(Math.max.apply(null, examineesLength)) + 1;
let strExamineeOne = examineeOne.join("");
let strExamineeTwo = examineeTwo.join("");
let strExamineeThree = examineeThree.join("");
for (let i = 0; i < maxExamineeLength; i++) {
strExamineeOne += examineeOne.join("");
strExamineeTwo += examineeTwo.join("");
strExamineeThree += examineeThree.join("");
}
return [strExamineeOne, strExamineeTwo, strExamineeThree];
}
function solution(answers) {
let examineeOne = [1, 2, 3, 4, 5];
let examineeTwo = [2, 1, 2, 3, 2, 4, 2, 5];
let examineeThree = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5];
const answersLength = answers.length;
const examineesLength = [
answersLength / examineeOne.length,
answersLength / examineeTwo.length,
answersLength / examineeThree.length,
];
let answerCount = [
{ answerCount: 0, name: 1 },
{ answerCount: 0, name: 2 },
{ answerCount: 0, name: 3 },
];
const isShouldAddExaminee = examineesLength.some(current => current > 1);
if (isShouldAddExaminee) {
const [strExamineeOne, strExamineeTwo, strExamineeThree] = examinees(
examineesLength,
answersLength,
examineeOne,
examineeTwo,
examineeThree
);
examineeOne = strExamineeOne.split("");
examineeTwo = strExamineeTwo.split("");
examineeThree = strExamineeThree.split("");
}
for (let i = 0; i < answersLength; i++) {
if (Number(examineeOne[i]) === answers[i]) {
answerCount[0]["answerCount"] += 1;
}
if (Number(examineeTwo[i]) === answers[i]) {
answerCount[1]["answerCount"] += 1;
}
if (Number(examineeThree[i]) === answers[i]) {
answerCount[2]["answerCount"] += 1;
}
}
return answerCount
.sort((a, b) =>
a.answerCount > b.answerCount ? -1 : a.answerCount < b.answerCount ? 1 : 0
)
.filter((current) => answerCount[0].answerCount === current.answerCount)
.map((current) => current.name);
}
function solution(answers) {
var answer = [];
var a1 = [1, 2, 3, 4, 5];
var a2 = [2, 1, 2, 3, 2, 4, 2, 5]
var a3 = [ 3, 3, 1, 1, 2, 2, 4, 4, 5, 5];
var a1c = answers.filter((a,i)=> a === a1[i%a1.length]).length;
var a2c = answers.filter((a,i)=> a === a2[i%a2.length]).length;
var a3c = answers.filter((a,i)=> a === a3[i%a3.length]).length;
var max = Math.max(a1c,a2c,a3c);
if (a1c === max) {answer.push(1)};
if (a2c === max) {answer.push(2)};
if (a3c === max) {answer.push(3)};
return answer;
}