[river20s] Week 4 #808
Merged
[river20s] Week 4 #808
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
After sorting the array in ascending order, we compare each index `i` with `nums[i]` to find the missing number. The time complexity is O(n log n) due to the sorting step. We might revisit this problem later to explore a more optimal O(n) solution with constant extra space.
TonyKim9401
reviewed
Jan 2, 2025
There was a problem hiding this comment.
가장 직관적이고 떠올리기 좋은 문제 풀이 방법이에요 :)
릿코드 문제에도 나와있는 것 처럼 O(n)의 시간복잡도로 푸는 방법도 있답니다.
O(n log n) 을 최적화 하여 O(n) 의 방법을 찾아보시면 어떨까요~!
SamTheKorean
approved these changes
Jan 5, 2025
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로 설정해주세요.