728x90
[2021 Dev-Matching] λ‘λμ μ΅κ³ μμμ μ΅μ μμ
μ½λ©ν μ€νΈ μ°μ΅ - λ‘λμ μ΅κ³ μμμ μ΅μ μμ
λ‘λ 6/45(μ΄ν 'λ‘λ'λ‘ νκΈ°)λ 1λΆν° 45κΉμ§μ μ«μ μ€ 6κ°λ₯Ό μ°μ΄μ λ§νλ λνμ μΈ λ³΅κΆμ λλ€. μλλ λ‘λμ μμλ₯Ό μ νλ λ°©μμ λλ€. 1 μμ λΉμ²¨ λ΄μ© 1 6κ° λ²νΈκ° λͺ¨λ μΌμΉ 2 5κ° λ²νΈ
programmers.co.kr
My μ½λ
function solution(lottos, win_nums) {
var answer = [];
let max;
let min;
let cnt_win = 0;
let cnt_zero = 0;
for(let i=0;i<lottos.length;i++) {
if(lottos[i] == 0)
cnt_zero += 1;
}
for(let i=0;i<lottos.length;i++) {
if(win_nums.includes(lottos[i])) {
cnt_win += 1;
}
}
min = checkRank(cnt_win);
max = min - cnt_zero;
if(cnt_zero == 6) {
min = 6;
max = 1;
}
answer = [max, min];
return answer;
}
function checkRank(cnt_win) {
if(cnt_win < 2){
return 6;
} else if (cnt_win == 2) {
return 5;
} else if (cnt_win == 3) {
return 4;
} else if (cnt_win == 4) {
return 3;
} else if (cnt_win == 5) {
return 2;
} else if (cnt_win == 6) {
return 1;
}
}
λ€λ₯Έ μ¬λμ νμ΄
function solution(lottos, win_nums) {
const rank = [6, 6, 5, 4, 3, 2, 1];
let minCount = lottos.filter(v => win_nums.includes(v)).length;
let zeroCount = lottos.filter(v => !v).length;
const maxCount = minCount + zeroCount;
return [rank[maxCount], rank[minCount]];
}
728x90
λκΈ