[장희직] - 게임, 연산자 끼워넣기, 디스크 컨트롤러, A와 B #177
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
bngsh
approved these changes
Sep 18, 2023
Comment on lines
+16
to
+17
| origin = StringBuilder(readln()) | ||
| goal = StringBuilder(readln()) |
There was a problem hiding this comment.
스트링빌더 아이디어 굿이네요,,,delete해주면 될걸 머리 싸매고 인덱스 계산을 했다니 ㅠㅠ
| } | ||
|
|
||
| if (plusCount > 0) { | ||
| plusCount-- |
There was a problem hiding this comment.
오 전 카운트를 전부 인자로 넣어서 함수 호출이 엄청 지저분했었는데 이렇게 하니 깔끔하네요
soopeach
approved these changes
Sep 18, 2023
| private fun change(): Int { | ||
| while (origin.length != goal.length) { | ||
| if (goal.last() == 'A') { | ||
| goal.deleteAt(goal.lastIndex) |
Comment on lines
+7
to
+15
| data class Pos( | ||
| val x: Int, | ||
| val y: Int | ||
| ) | ||
|
|
||
| data class Area( | ||
| var type: Int, // 0 -> 안전, 1 -> 위험, 2-> 죽음 | ||
| var lostLife: Int | ||
| ) |
Comment on lines
+83
to
+101
| else if (nextType == 1) { | ||
| if (visited[nx][ny].not()) { | ||
| visited[nx][ny] = true | ||
| queue.add(Pos(nx, ny)) | ||
| board[nx][ny].lostLife = originLostLife + 1 | ||
| } else if (originLostLife + 1 < nextLostLife) { | ||
| queue.add(Pos(nx, ny)) | ||
| board[nx][ny].lostLife = originLostLife + 1 | ||
| } | ||
| } else if (nextType == 0) { | ||
| if (visited[nx][ny].not()) { | ||
| visited[nx][ny] = true | ||
| queue.add(Pos(nx, ny)) | ||
| board[nx][ny].lostLife = originLostLife | ||
| } else if (originLostLife < nextLostLife) { | ||
| queue.add(Pos(nx, ny)) | ||
| board[nx][ny].lostLife = originLostLife | ||
| } | ||
| } |
There was a problem hiding this comment.
다시 탐색할 가치를 확인하고 다시 queue에 넣어주는 방법은 생각지도 못했는데 대단하십니다
Comment on lines
+22
to
+26
| operators = readln().split(' ').map { it.toInt() } | ||
| plusCount = operators[0] | ||
| minusCount = operators[1] | ||
| multiCount = operators[2] | ||
| divideCount = operators[3] |
There was a problem hiding this comment.
병희님이 말씀하신 구조 분해를 써도 괜찮을 것 같습니다!
| } | ||
|
|
||
| if (plusCount > 0) { | ||
| plusCount-- |
jeeminimini
approved these changes
Sep 18, 2023
Comment on lines
+88
to
+91
| } else if (originLostLife + 1 < nextLostLife) { | ||
| queue.add(Pos(nx, ny)) | ||
| board[nx][ny].lostLife = originLostLife + 1 | ||
| } |
Comment on lines
+21
to
+28
| while (origin.length != goal.length) { | ||
| if (goal.last() == 'A') { | ||
| goal.deleteAt(goal.lastIndex) | ||
| } else { | ||
| goal.deleteAt(goal.lastIndex) | ||
| goal.reverse() | ||
| } | ||
| } |
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 #175 📌
📋문제 목록📋