[전현수] - 괄호 회전하기, 후위 표기식, 캐슬 디펜스 #272
Merged
Conversation
This file contains 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
jeeminimini
approved these changes
Jun 2, 2024
| fun solution(s: String): Int { | ||
| var answer = 0 | ||
|
|
||
| val target = s + s |
| * - 트러블 슈팅 | ||
| * | ||
| */ | ||
| class `전현수_후위_표기식` { |
bngsh
approved these changes
Jun 2, 2024
Comment on lines
+32
to
+37
| // 좌 상 우 | ||
| private val dirs = listOf( | ||
| Position(0, -1), | ||
| Position(-1, 0), | ||
| Position(0, 1), | ||
| ) |
|
|
||
| var curEliminatedCnt = 0 | ||
|
|
||
| for (archerX in n - 1 downTo 0) { |
There was a problem hiding this comment.
적이 내려오는 게 아니라 궁수를 올리는 게 적을 내리는 연산을 할 필요도 없고 똑똑하네요
Comment on lines
+25
to
+50
| '(' -> { | ||
| stack.push('(') | ||
| } | ||
|
|
||
| '*', '/' -> { | ||
| while (stack.isNotEmpty()) { | ||
| if (stack.peek() == '*' || stack.peek() == '/') sb.append(stack.pop()) | ||
| else break | ||
| } | ||
| stack.push(ch) | ||
| } | ||
|
|
||
| '+', '-' -> { | ||
| while (stack.isNotEmpty()) { | ||
| if (stack.peek() == '(') break | ||
| sb.append(stack.pop()) | ||
| } | ||
| stack.push(ch) | ||
| } | ||
|
|
||
| ')' -> { | ||
| while (stack.isNotEmpty()) { | ||
| val fromStack = stack.pop() | ||
| if (fromStack == '(') break | ||
| sb.append(fromStack) | ||
| } |
There was a problem hiding this comment.
스위치문을 이용하니 뭔가 우선순위가 시각적으로 보여지는 느낌이라 좋았어요
jhg3410
approved these changes
Jun 2, 2024
Comment on lines
+32
to
+37
| // 좌 상 우 | ||
| private val dirs = listOf( | ||
| Position(0, -1), | ||
| Position(-1, 0), | ||
| Position(0, 1), | ||
| ) |
Comment on lines
+85
to
+111
| val queue: Queue<Bundle> = LinkedList() | ||
|
|
||
| queue.add(Bundle(Position(archerX, curArcherY), 1)) | ||
|
|
||
| while (queue.isNotEmpty()) { | ||
|
|
||
| val (curPos, curRange) = queue.poll() | ||
|
|
||
| if (curBoard[curPos.x][curPos.y] == 1) { | ||
| targetSet.add(Position(curPos.x, curPos.y)) | ||
| return@forEach | ||
| } | ||
|
|
||
| if (curRange < range) { | ||
| dirs.forEach dir@{ | ||
| val nx = curPos.x + it.x | ||
| val ny = curPos.y + it.y | ||
|
|
||
|
|
||
| if (nx !in 0 until n || | ||
| ny !in 0 until m | ||
| ) return@dir | ||
|
|
||
| queue.add(Bundle(Position(nx, ny), curRange + 1)) | ||
| } | ||
| } | ||
| } |
Comment on lines
+25
to
+50
| '(' -> { | ||
| stack.push('(') | ||
| } | ||
|
|
||
| '*', '/' -> { | ||
| while (stack.isNotEmpty()) { | ||
| if (stack.peek() == '*' || stack.peek() == '/') sb.append(stack.pop()) | ||
| else break | ||
| } | ||
| stack.push(ch) | ||
| } | ||
|
|
||
| '+', '-' -> { | ||
| while (stack.isNotEmpty()) { | ||
| if (stack.peek() == '(') break | ||
| sb.append(stack.pop()) | ||
| } | ||
| stack.push(ch) | ||
| } | ||
|
|
||
| ')' -> { | ||
| while (stack.isNotEmpty()) { | ||
| val fromStack = stack.pop() | ||
| if (fromStack == '(') break | ||
| sb.append(fromStack) | ||
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
📌 from issue #271 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
공유하고 싶은 정보, 새롭게 알게된 것, 문제를 풀면서 발생한 에로사항 등...자유롭게!