[장희직] 기적의 매매법, 수 이어 쓰기 1, 등수 구하기, DNA #64
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
Jan 1, 2023
| dnaList.forEach { dna -> dnaByIdx += dna[it] } | ||
|
|
||
| var maxCnt = 0 | ||
| "ACGT".forEach { c -> maxCnt = max(maxCnt, dnaByIdx.count { c == it }) } |
There was a problem hiding this comment.
문자열 써서 인덱스로 이용하는 거 좋아보이네요...👍
| } | ||
| val scores = readln().split(' ').map { it.toInt() }.toMutableList() | ||
|
|
||
| scores.sort() |
There was a problem hiding this comment.
거꾸로 정렬하신 것도 신기했는데 count로 세면 아예 정렬할 필요가 없는 게 대박이네유..
| "ACGT".forEach { c -> maxCnt = max(maxCnt, dnaByIdx.count { c == it }) } | ||
|
|
||
| answerDna += dnaByIdx.filter { c -> maxCnt == dnaByIdx.count { c == it } }.min() | ||
| answerCnt += dnaByIdx.count { it != answerDna.last() } |
soopeach
approved these changes
Jan 1, 2023
| var maxCnt = 0 | ||
| "ACGT".forEach { c -> maxCnt = max(maxCnt, dnaByIdx.count { c == it }) } | ||
|
|
||
| answerDna += dnaByIdx.filter { c -> maxCnt == dnaByIdx.count { c == it } }.min() |
| if (scores.count { it >= score } >= p) { | ||
| println(-1) | ||
| } else { | ||
| println(scores.count { it > score } + 1) |
There was a problem hiding this comment.
count를 단순히 개수를 셀 때만 이용했는데... 역시 똑똑하십니다.
Comment on lines
+16
to
+24
| private fun getDigit(_num : Int): Int { | ||
| var num = _num | ||
| var cnt = 0 | ||
| while (num != 0) { | ||
| num /= 10 | ||
| cnt ++ | ||
| } | ||
| return cnt | ||
| } |
| @@ -0,0 +1,71 @@ | |||
| package heejik.`13week` | |||
|
|
|||
| class `🐜 기적의 매매법 🐜` { | |||
jeeminimini
approved these changes
Jan 1, 2023
| dnaList.forEach { dna -> dnaByIdx += dna[it] } | ||
|
|
||
| var maxCnt = 0 | ||
| "ACGT".forEach { c -> maxCnt = max(maxCnt, dnaByIdx.count { c == it }) } |
|
|
||
| scores.sort() | ||
|
|
||
| if (scores.count { it >= score } >= p) { |
Comment on lines
+9
to
+10
| val bnf = bnf(money, stocks) | ||
| val timing = timing(money, stocks) |
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 #61 📌
📋문제 목록📋
📍추가로 해결한 문제📍