[전현수] - 도시 건설, 괄호 제거, 싸지방에 간 준하, 타일 채우기 #263
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
May 20, 2024
Comment on lines
+52
to
+75
| private fun IntArray.isValid(): Boolean { | ||
| for (i in 1 until this.size) { | ||
| if (findParent(i, this) != 1) return false | ||
| } | ||
| return true | ||
| } | ||
|
|
||
| private fun findParent(target: Int, parentInfo: IntArray): Int { | ||
| return if (target == parentInfo[target]) target | ||
| else findParent(parentInfo[target], parentInfo) | ||
| } | ||
|
|
||
| private fun Int.hasSameParent(other: Int, parentInfo: IntArray): Boolean { | ||
| return findParent(this, parentInfo) == findParent(other, parentInfo) | ||
| } | ||
|
|
||
| private fun union(a: Int, b: Int, parentInfo: IntArray) { | ||
|
|
||
| val aParent = findParent(a, parentInfo) | ||
| val bParent = findParent(b, parentInfo) | ||
|
|
||
| if (aParent < bParent) parentInfo[bParent] = aParent | ||
| else parentInfo[aParent] = bParent | ||
| } |
Comment on lines
+25
to
+37
| val useInfoPq = PriorityQueue<UseInfo>( | ||
| Comparator { a, b -> | ||
| a.start - b.start | ||
| } | ||
| ) | ||
|
|
||
| val computerPq = PriorityQueue<ComInfo> { a, b -> | ||
| a.num - b.num | ||
| } | ||
|
|
||
| val usingInfoPq = PriorityQueue<UsingInfo> { a, b -> | ||
| a.end - b.end | ||
| } |
There was a problem hiding this comment.
pq를 여러개 쓰면 너무 복잡할 거 같았는데 오히려 그냥 시뮬레이션 같고 깔끔하네요
| } else if (target[i] == ')') { | ||
| if (stack.isNotEmpty()) { | ||
| parenthesisInfoList.add( | ||
| ParenthesisInfo(stack.pop(), i) |
jeeminimini
approved these changes
May 20, 2024
Comment on lines
+25
to
+37
| val useInfoPq = PriorityQueue<UseInfo>( | ||
| Comparator { a, b -> | ||
| a.start - b.start | ||
| } | ||
| ) | ||
|
|
||
| val computerPq = PriorityQueue<ComInfo> { a, b -> | ||
| a.num - b.num | ||
| } | ||
|
|
||
| val usingInfoPq = PriorityQueue<UsingInfo> { a, b -> | ||
| a.end - b.end | ||
| } |
jhg3410
approved these changes
May 20, 2024
Comment on lines
+46
to
+52
| for (i in target.indices) { | ||
| if (target[i] == '(') { | ||
| stack.add(i) | ||
| } else if (target[i] == ')') { | ||
| if (stack.isNotEmpty()) { | ||
| parenthesisInfoList.add( | ||
| ParenthesisInfo(stack.pop(), i) |
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 #261 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
공유하고 싶은 정보, 새롭게 알게된 것, 문제를 풀면서 발생한 에로사항 등...자유롭게!