[소병희] 근손실, 비슷한 단어, 아기상어2, 트리의 부모 찾기, 회의실 배정 #27
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
soopeach
reviewed
Oct 23, 2022
|
|
||
| for(i in 0 until n) { | ||
| if (visited[i]) continue | ||
| if (curPerm + workouts[i] < 0) continue |
| } | ||
|
|
||
| fun isInBound(h: Int, w: Int) : Boolean { | ||
| return r in 0 until h && c in 0 until w |
There was a problem hiding this comment.
Pos / isInBound를 데이터 클래스의 메서드로 만드신 점이 인상깊습니다..!!
|
|
||
| repeat(n-1) { i -> | ||
| br.readLine().split(" ").map{ it.toInt() }.run { | ||
| edges.getOrPut(first()) { mutableListOf() } |
| data class Meeting(val s: Int, val e: Int) | ||
|
|
||
| var n = 0 | ||
| val meetings = PriorityQueue(Comparator<Meeting> { a, b -> if (a.e == b.e) a.s - b.s else a.e - b.e }) |
There was a problem hiding this comment.
우선순위 큐 자주 사용하시던데 저도 사용해봐야겠어요..!
jeeminimini
reviewed
Oct 23, 2022
| data class Meeting(val s: Int, val e: Int) | ||
|
|
||
| var n = 0 | ||
| val meetings = PriorityQueue(Comparator<Meeting> { a, b -> if (a.e == b.e) a.s - b.s else a.e - b.e }) |
There was a problem hiding this comment.
PriorityQueue 써서 정렬할 수도 있군요!
| n = first() | ||
| k = last() | ||
| } | ||
| workouts = br.readLine().split(" ").map { it.toInt() - k }.toIntArray() |
There was a problem hiding this comment.
미리 k를 뺀게 더 이해하기 좋은 것 같아요! 기본값이 변해도 상관없겠네요!
|
|
||
| for(i in 0 until n) { | ||
| if (visited[i]) continue | ||
| if (curPerm + workouts[i] < 0) continue |
There was a problem hiding this comment.
계산하는 과정에서 0 미만이면 continue하는거 좋네요!
|
|
||
| repeat(n-1) { i -> | ||
| br.readLine().split(" ").map{ it.toInt() }.run { | ||
| edges.getOrPut(first()) { mutableListOf() } |
jhg3410
reviewed
Oct 23, 2022
|
|
||
| repeat(n-1) { i -> | ||
| br.readLine().split(" ").map{ it.toInt() }.run { | ||
| edges.getOrPut(first()) { mutableListOf() } |
jhg3410
reviewed
Oct 23, 2022
| return Pos(r + p.r, c + p.c) | ||
| } | ||
|
|
||
| fun isInBound(h: Int, w: Int) : Boolean { |
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 #26 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모
공유하고 싶은 정보, 새롭게 알게된 것, 문제를 풀면서 발생한 에로사항 등...자유롭게!