[2주차] 백제완 #16
Merged
[2주차] 백제완 #16
Conversation
This file contains hidden or 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
KodaHye
reviewed
Sep 21, 2024
| // Rank를 이용한 Union | ||
| // Rank: 트리의 대략적인 높이 | ||
| // 높이가 작은 트리를 높이가 큰 트리 아래에 붙여 트리의 높이가 불필요하게 커지지 않도록 함 | ||
| // Rank가 작은 트리를 큰 트리에 붙임으로써, 트리의 깊이가 크게 증가하지 않으므로, Find 연산 최적화 |
There was a problem hiding this comment.
Rank를 사용하면 find연산을 최적화할 수 있군요,,,
배워갑니당,,!!
There was a problem hiding this comment.
맞슴다..! 혹시 모르니 항상 최적화된 방식으로 구현하려고 하고 있어여
yeongleej
reviewed
Sep 21, 2024
| for (int k = 0; k < 2; k++) { | ||
| int y = i + dy[k]; | ||
| int x = j + dx[k]; | ||
| // 현재 좌표의 그룹과 다음 좌표의 그룹이 다를 경우 |
There was a problem hiding this comment.
두 좌표를 비교하는 것이 두 그룹을 비교하는 것과 같은 로직이라는 것이 좋은 아이디어인 것 같습니다! 👍
baexxbin
reviewed
Sep 21, 2024
| int len = 0; // LIS의 길이 | ||
| for (int i = 0; i < n; i++) { | ||
| int value = read(); | ||
| int idx = Arrays.binarySearch(arr, 0, len, value); // 이분탐색으로 적절한 위치 반환 |
There was a problem hiding this comment.
오 Arrays.binarySearch()함수와 보수연산으로 깔끔하게 구현을 할 수 있군요!!
There was a problem hiding this comment.
중복없는 배열에서 이분탐색할 때 사용하면 좋은 메서드 같아요~!
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.
No description provided.