Jayden`s

    220630(๋ชฉ) ๋ฏธ๊ตญ ๊ฒฝ์ œ ๋น„๊ด€๋ก 

    220630(๋ชฉ) ๋ฏธ๊ตญ ๊ฒฝ์ œ ๋น„๊ด€๋ก 

    ๋ช‡๋‹ฌ ์ „๋ถ€ํ„ฐ ๋‹ค๋ค„์ง€๋Š” ์ฃผ์ œ์ธ๋ฐ, ์ ์  ๋ฏธ๊ตญ ๊ฒฝ์ œ ์นจ์ฒด์— ๋Œ€ํ•œ ๋ถ„์œ„๊ธฐ๊ฐ€ ๊ฐ€์†ํ™”๋˜๋Š” ๊ฒƒ ๊ฐ™๋‹ค. ๊ฒฝ๊ธฐ์นจ์ฒด๊ฐ€ ๋นจ๋ผ์ง€๋Š” ๋Š๋‚Œ์ด๋ผ๊ธฐ๋ณด๋‹จ(์ด๊ฑด ๋‚ด๊ฐ€ ์ง์ ‘ ๋Š๋‚„ ์ˆ˜ ์—†์œผ๋‹ˆ๊นŒ) ๋ฏธ๊ตญ ๊ฒฝ๊ธฐ์— ๋Œ€ํ•œ ์˜ˆ์ƒ ๋ฐ ๋ถ„์œ„๊ธฐ์˜ ์†๋„๊ฐ€ ๋นจ๋ผ์ง€๋Š” ๊ธฐ๋ถ„..? ๋ช‡๋‹ฌ ์ „์—๋งŒ ํ•ด๋„ ๊ฒฝ๊ธฐ์นจ์ฒด์ธ๊ฐ€ ์•„๋‹Œ๊ฐ€ ๊ธฐ์‚ฌ๊ฐ€ ๋‚˜์˜ค๋”๋‹ˆ ๋ช‡์ฃผ์ „๋ถ€ํ„ฐ ๊ฒฝ๊ธฐ์นจ์ฒด ์˜ˆ์ƒ ๊ธฐ์‚ฌ๊ฐ€ ๋‚˜์™”๋‹ค. ๊ทธ๋Ÿฌ๋”๋‹ˆ ์ด์ œ๋Š” ์ด๋ฏธ ๊ฒฝ๊ธฐ์นจ์ฒด์— ์žˆ๋‹ค๊ณ  ํ•˜๋Š” ๊ธฐ์‚ฌ๊ฐ€ ๋‚˜์˜ค๊ณ  ์žˆ๊ณ  ์ด ๊ฐ„๊ฒฉ์€ ์ ์  ์งง์•„์ง€๋Š” ๊ฑฐ ๊ฐ™๋‹ค. ํ•œ๋‹ฌ ๋’ค์— "๋ฏธ๊ตญ ๊ฒฝ์ œ ํšŒ๋ณต ์กฐ์ง ํฌ์ฐฉ"์ด๋ผ๋Š” ๊ธฐ์‚ฌ๊ฐ€ ๋‚˜์™€๋„ ๋ณ„๋กœ ๋†€๋ž์ง€๋„ ์•Š์„ ๋Š๋‚Œ

    [JS] 2019์นด์นด์˜ค - ํฌ๋ ˆ์ธ ์ธํ˜•๋ฝ‘๊ธฐ ๊ฒŒ์ž„

    function solution(board, moves) { let answer = 0; const n = board.length; let basket = []; let moveToIndex = moves.map((move) => move - 1); for (let move of moveToIndex) { for (let i = 0; i < n; i++) { if (board[i][move]) { if (basket[basket.length - 1] === board[i][move]) { basket.pop(); board[i][move] = 0; answer += 2; break; } else { basket.push(board[i][move]); board[i][move] = 0; break; } }..

    [JS] ์†Œ์ˆ˜ ๋งŒ๋“ค๊ธฐ

    function solution(nums) { var answer = 0; let sumAll = []; let n = nums.length; for (let i = 0; i < n - 2; i++) { for (let j = i + 1; j < n - 1; j++) { for (let k = j + 1; k < n; k++) { sumAll.push(nums[i] + nums[j] + nums[k]); } } } for (let sum of sumAll) { let temp = 1; for (let j = 2; j < sum; j++) { if (sum % j === 0) { temp = 0; break; } } answer += temp; } return answer; } ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต..

    220629(์ˆ˜) ์–‘๋งŒ๊ธˆ ๋„ค์ปท ๋งŒํ™”

    220629(์ˆ˜) ์–‘๋งŒ๊ธˆ ๋„ค์ปท ๋งŒํ™”

    ํ—ˆํ—ฃ ์‚ฌ์‹ค ์˜ค๋Š˜์€ ์Šคํฌ๋žฉํ•˜๊ณ  ์‹ถ์€ ๊ธฐ์‚ฌ๊ฐ€ ์—†์—ˆ๋‹ค. ํ•ญ์ƒ ๋„ค์ปท๋งŒํ™”๋Š” ์ „๋ฐ˜์ ์ธ ํ˜„ ์ƒํ™ฉ์„ ์ž˜ ํ‘œํ˜„ํ•ด์ฃผ๊ณ  ์„ผ์Šค์žˆ๊ฒŒ ๋‹ค๋ค„์ฃผ์–ด์„œ ์žฌ๋ฏธ์žˆ๊ฒŒ ๋ณด๊ณ  ์žˆ๋‹ค. :)

    [JS] ๊ทธ๋ฆฌ๋”” - ์ฒด์œก๋ณต

    function solution(n, lost, reserve) { let answer = 0; let students = new Array(n + 1).fill(1); for (let i = 1; i < n + 1; i++) { if (lost.includes(i)) { students[i]--; } if (reserve.includes(i)) { students[i]++; } } for (let i = 1; i < n + 1; i++) { if (students[i] === 0) { if (students[i - 1] === 2) { students[i - 1]--; students[i]++; } else if (students[i + 1] === 2) { students[i + 1]--; stude..