Algorithm Problem/JavaScript

[javascript] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค - ๋กœ๋˜์˜ ์ตœ๊ณ  ์ˆœ์œ„์™€ ์ตœ์ € ์ˆœ์œ„(2021 Dev-Matching: ์›น ๋ฐฑ์—”๋“œ ๊ฐœ๋ฐœ์ž(์ƒ๋ฐ˜๊ธฐ))

deo2kim 2021. 8. 8. 15:05
๋ฐ˜์‘ํ˜•

๐Ÿค”๋ฌธ์ œ ํ•ด๊ฒฐ

1. filter์™€ includes๋ฅผ ์ด์šฉํ•ด์„œ ๋กœ๋˜ ๋ฒˆํ˜ธ๊ฐ€ ๋‹น์ฒจ ๋ฒˆํ˜ธ์— ํฌํ•จ๋œ ๊ฐœ์ˆ˜๋ฅผ ๊ตฌํ•จ

2. filter๋ฅผ ์ด์šฉํ•ด์„œ ๋กœ๋˜ ๋ฒˆํ˜ธ์˜ 0์˜ ๊ฐœ์ˆ˜๋ฅผ ๊ตฌํ•จ

3. ์ตœ์†Œ ๋‹น์ฒจ ๊ฐœ์ˆ˜๋Š” ๊ทธ๋ƒฅ ๋‹น์ฒจ ๊ฐœ์ˆ˜

4. ์ตœ๋Œ€ ๋‹น์ฒจ ๊ฐœ์ˆ˜๋Š” ์ตœ์†Œ ๋‹น์ฒจ ๊ฐœ์ˆ˜ + 0์˜ ๊ฐœ์ˆ˜

5. ์ˆœ์œ„๋ฅผ ๊ตฌํ•จ

 

๐Ÿ’จ

 

๐Ÿ’ป์†Œ์Šค ์ฝ”๋“œ

 function solution(lottos, win_nums) {
    var answer = [];

    var minWinningCnt = lottos.filter(number => win_nums.includes(number)).length;
    var maxWinningCnt = minWinningCnt + lottos.filter(number => number === 0).length;

    var rank = [6, 6, 5, 4, 3, 2, 1];
    answer = [rank[maxWinningCnt], rank[minWinningCnt]];
    
    return answer;
}

console.log(solution([44, 1, 0, 0, 31, 25], [31, 10, 45, 1, 6, 19]));
console.log(solution([0, 0, 0, 0, 0, 0], [38, 19, 20, 40, 15, 25]));
console.log(solution([45, 4, 35, 20, 3, 9]	, [20, 9, 3, 45, 4, 35]));

 

๐Ÿ“•๋ฌธ์ œ ํ™•์ธ

์ถœ์ฒ˜: ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

 

๋ฐ˜์‘ํ˜•