-
Notifications
You must be signed in to change notification settings - Fork 98
문제 풀이 추가 #65
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
문제 풀이 추가 #65
Changes from 3 commits
Commits
Show all changes
6 commits
Select commit
Hold shift + click to select a range
4ab0ba6
Create 방금-그곡.js
minjongbaek f254aa5
Create 빛의-경로-사이클
minjongbaek e8bb651
Create k-진수에서-소수-개수-구하기
minjongbaek 05f6972
Comment k진수에서-소수-개수-구하기
minjongbaek 459591e
Comment [3차]-방금그곡
minjongbaek 7d3d17a
Comment 빛의-경로-사이클
minjongbaek File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
13 changes: 13 additions & 0 deletions
level-2/k-진수에서-소수-개수-구하기.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,13 @@ | ||
| function isPrime(number) { | ||
|
||
| if (number < 2) return false; | ||
| for (let i = 2; i * i <= number; i += 1) { | ||
| if (number % i === 0) { | ||
| return false; | ||
| } | ||
| } | ||
| return true; | ||
| } | ||
|
|
||
| function solution(n, k) { | ||
| return (n).toString(k).split('0').filter((number) => isPrime(+number)).length; | ||
| } | ||
27 changes: 27 additions & 0 deletions
level-2/방금-그곡.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,27 @@ | ||
| function convertString(m) { | ||
|
||
| return m | ||
| .replace(/C#/g, 'c') | ||
| .replace(/D#/g, 'd') | ||
| .replace(/F#/g, 'f') | ||
| .replace(/G#/g, 'g') | ||
| .replace(/A#/g, 'a'); | ||
| } | ||
|
|
||
| function solution(m, musicinfos) { | ||
| const listenSound = convertString(m); | ||
|
|
||
| const map = new Map(); | ||
| for (const info of musicinfos) { | ||
| const [start, finish, title, _score] = info.split(','); | ||
| const duration = ((+finish.slice(0, 2) * 60) + (+finish.slice(3, 5))) - ((+start.slice(0, 2) * 60) + (+start.slice(3, 5))); | ||
|
||
|
|
||
| const score = convertString(_score); | ||
| const playScore = score.repeat(Math.ceil(duration / score.length)).slice(0, duration); | ||
| if (playScore.includes(listenSound)) { | ||
| map.set(title, {score, playScore}); | ||
| } | ||
| } | ||
|
|
||
| const filter = [...map.keys()].sort((a,b) => map.get(b).playScore.length - map.get(a).playScore.length); | ||
| return filter.length >= 1 ? filter[0] : '(None)'; | ||
| } | ||
62 changes: 62 additions & 0 deletions
level-2/빛의-경로-사이클.js
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,62 @@ | ||
| const DX = [-1, 1, 0, 0]; | ||
|
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. 해당 해설에도 주석 부탁드립니다! |
||
| const DY = [0, 0, -1, 1]; | ||
|
|
||
| function solution(grid) { | ||
| const answer = []; | ||
| const visited = Array.from({ length: grid.length }, () => []).map((v) => { | ||
| for (let i = 0; i < grid[0].length; i += 1) { | ||
| v.push(new Array(4).fill(false)); | ||
| } | ||
| return v | ||
| }); | ||
|
|
||
| for (let x = 0; x < grid.length; x += 1) { | ||
| for (let y = 0; y < grid[0].length; y += 1) { | ||
| for (let d = 0; d < 4; d += 1) { | ||
| if (!visited[x][y][d]) { | ||
| const stack = []; | ||
| stack.push([x, y, d]); | ||
|
|
||
| let cnt = 0; | ||
| while (stack.length !== 0) { | ||
| const [currentX, currentY, currentD] = stack.pop(); | ||
| if (!visited[currentX][currentY][currentD]) { | ||
| visited[currentX][currentY][currentD] = true; | ||
| cnt += 1; | ||
|
|
||
| const [nextX, nextY] = getNextXY(currentX, currentY, currentD, grid.length, grid[0].length); | ||
| const nextD = getNextD(grid[nextX][nextY], currentD) | ||
|
|
||
| stack.push([nextX, nextY, nextD]) | ||
| } | ||
|
|
||
| } | ||
| answer.push(cnt); | ||
| } | ||
| } | ||
| } | ||
| } | ||
| return answer.sort((a, b) => a - b); | ||
| } | ||
|
|
||
|
|
||
| function getNextXY(x, y, d, xLength, yLength) { | ||
| x += DX[d]; | ||
| y += DY[d]; | ||
|
|
||
| if (x < 0) x = xLength - 1; | ||
| if (x >= xLength) x = 0; | ||
| if (y < 0) y = yLength - 1; | ||
| if (y >= yLength) y = 0; | ||
|
|
||
| return [x, y]; | ||
| } | ||
|
|
||
| function getNextD(command, d) { | ||
| if (command === 'L') { | ||
| d = [2, 3, 1, 0][d] | ||
| } else if (command === 'R') { | ||
| d = [3, 2, 0, 1][d] | ||
| } | ||
| return d | ||
| } | ||
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.