Jayden`s
![220630(๋ชฉ) ๋ฏธ๊ตญ ๊ฒฝ์ ๋น๊ด๋ก](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FdoAneF%2FbtrF6bAd7MP%2FrQ6xecb5eCPbQT3zHe6wg1%2Fimg.png)
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(์) ์๋ง๊ธ ๋ค์ปท ๋งํ](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F6kph8%2FbtrFZkSzAxw%2FPSmu5Rs2LXEqEBdasQ8rRk%2Fimg.png)
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..