[이지민] 킹, 바닥 장식, 빙고, 랜선 자르기, 가로수 #23
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 16, 2022
| treeList.add(readLine().toInt()) | ||
| } | ||
|
|
||
| treeList.sort() |
There was a problem hiding this comment.
문제에 명확히 조건 표기가 안되어있었지만 정렬해주시는 센스가 좋은 것 같습니다!!👍
| treeList.sort() | ||
|
|
||
| val treeDistanceList = arrayListOf<Int>() | ||
| treeList.forEachIndexed { index, _ -> |
Comment on lines
+24
to
+25
| var min = 1L | ||
| var max = lanCableList.sorted().last() |
There was a problem hiding this comment.
저는 정답을 담을 별도의 변수를 만들었는데 최소 / 최대, 이 두 가지 변수만으로 해결하신게 멋있습니다!
Comment on lines
+24
to
+25
|
|
||
| fun checkRow(n: Int, m: Int): Int { |
|
|
||
| val nowHostResult = mutableListOf<Int>() | ||
|
|
||
| hostResult.flatten().forEachIndexed { idx, it -> |
There was a problem hiding this comment.
flatten() 대박인 것 같아요~~ 저는 리스트를 순차탐색해서 원소들을 넣어주었는데..
|
|
||
| fun main(): Unit = with(BufferedReader(InputStreamReader(System.`in`))) { | ||
| val (king, dol, n) = readLine().split(" ") | ||
| var kingX = king[0] - 'A' |
There was a problem hiding this comment.
'A" 자체를 빼서 0으로 만든 부분이 정말 좋은 것 같습니다!!
| movementResult.add(readLine()) | ||
| } | ||
| val movementOfKing = | ||
| mapOf<String, Pair<Int, Int>>( |
There was a problem hiding this comment.
맵으로 명령어랑 이동할 좌표를 잘 관리하신 것 같아요!!!
근데 맵은 널체크가 계속 필요해서 뭔가 아쉽네요ㅜㅜ
jhg3410
reviewed
Oct 16, 2022
Comment on lines
+35
to
+41
| for (i in minDistance downTo 1){ | ||
| if (treeDistanceList.all { it % i == 0}) { | ||
| treeDistanceList.forEach { | ||
| sum += it / i - 1 | ||
| } | ||
| println(sum) | ||
| break |
Comment on lines
+27
to
+30
| if (min > max) { | ||
| println(max) | ||
| break | ||
| } |
There was a problem hiding this comment.
따로 값을 할당하지 않고 max 값을 결괏값으로 사용할 수 있군요!
Comment on lines
+27
to
+32
| for (i in 0 until n) { | ||
| for (j in 0 until m) { | ||
| if (j == m - 1 && bottomDesign[i][j] == "-") { | ||
| num += 1 | ||
| } else if (bottomDesign[i][j] == "-" && bottomDesign[i][j + 1] == "|") { | ||
| num += 1 |
There was a problem hiding this comment.
각 내부(j) 값을 계속해서 돌면서 체크하는 부분이 좋은 방법이네요!!
Comment on lines
+68
to
+83
| fun checkDiagonal(nowHostResult: MutableList<Int>): Int { | ||
| var bingo = 0 | ||
| var check1 = true | ||
| var check2 = true | ||
| for (i in 0 until 5){ | ||
| if (userResult[i][i] !in nowHostResult) check1 = false | ||
| if (userResult[i][4 - i] !in nowHostResult) check2 = false | ||
| } | ||
| if (check1) { | ||
| bingo += 1 | ||
| } | ||
| if (check2) { | ||
| bingo += 1 | ||
| } | ||
|
|
||
| return bingo |
Comment on lines
+32
to
+35
| bingo += checkRow(nowHostResult) | ||
| bingo += checkColumn(nowHostResult) | ||
| bingo += checkDiagonal(nowHostResult) | ||
| if (bingo >= 3) { |
bngsh
reviewed
Oct 16, 2022
Comment on lines
+35
to
+43
| for (i in minDistance downTo 1){ | ||
| if (treeDistanceList.all { it % i == 0}) { | ||
| treeDistanceList.forEach { | ||
| sum += it / i - 1 | ||
| } | ||
| println(sum) | ||
| break | ||
| } | ||
| } |
There was a problem hiding this comment.
어차피 젤 작은 간격보다 최대공약수가 클 수가 없다는 생각 멋집니다..! 시간이 엄청 짧아질 것 같아요
| repeat(n) { | ||
| bottomDesign.add(readLine().chunked(1).toMutableList()) | ||
| } | ||
| println(checkRow(n,m) + checkColumn(n,m)) |
There was a problem hiding this comment.
가로 세로 따로 세서 더하는 게 깔끔해보여서 멋졌습니다!
Comment on lines
+41
to
+42
| for (i in 0 until m) { | ||
| for (j in 0 until n) { |
|
|
||
| val nowHostResult = mutableListOf<Int>() | ||
|
|
||
| hostResult.flatten().forEachIndexed { idx, it -> |
There was a problem hiding this comment.
진짜 flatten() 대박이에요....오늘 딱 기억에 남아서 저도 써먹어봐야겠습니다!!
| bingo += checkDiagonal(nowHostResult) | ||
| if (bingo >= 3) { | ||
| println(idx + 1) | ||
| return@with |
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 #21 📌
📋문제 목록📋
📍추가로 해결한 문제📍
📝메모