[mintheon] Week 09 #990
Merged
[mintheon] Week 09 #990
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
TonyKim9401
reviewed
Feb 4, 2025
There was a problem hiding this comment.
해당 문제의 경우 시간 복잡도를 O(n) 으로 하셔도 괜찮지만, 조건 상 O(log n) 으로 되어있기 때문에 다시 한번 풀이에 도전해 보셔도 괜찮을것 같아요 :)
TonyKim9401
reviewed
Feb 4, 2025
There was a problem hiding this comment.
LinkedList 의 특징을 잘 살려서 풀이 해 주신것 같습니다!
이후에도 비슷한 문제가 나올 예정입니다!
ekgns33
reviewed
Feb 6, 2025
| for(int i = 0; i < nums.length; i++) { | ||
| result = Math.max(result, maxValue[i]); | ||
| } | ||
|
|
There was a problem hiding this comment.
O(n)으로 풀어주셨군요 👍 첫번째 for-loop에서 비소대교를 하면 루프를 줄일 수 있을 것 같아요!
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.
답안 제출 문제
체크 리스트
In Review로 설정해주세요.