-
-
Notifications
You must be signed in to change notification settings - Fork 336
[reeseo3o] WEEK 13 Solutions #2619
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
+21
−0
Merged
Changes from all commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,21 @@ | ||
| // Time Complexity: O(nlogn) | ||
| // Space Complexity: O(1) | ||
|
|
||
| const canAttendMeetings = function (intervals) { | ||
| if (!intervals || intervals.length <= 1) { | ||
| return true; | ||
| } | ||
|
|
||
| intervals.sort((a, b) => a[0] - b[0]); | ||
|
|
||
| for (let i = 1; i < intervals.length; i++) { | ||
| const prevEnd = intervals[i - 1][1]; | ||
| const currStart = intervals[i][0]; | ||
|
|
||
| if (currStart < prevEnd) { | ||
| return false; | ||
| } | ||
| } | ||
|
|
||
| return true; | ||
| }; |
Oops, something went wrong.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
🏷️ 알고리즘 패턴 분석
📊 시간/공간 복잡도 분석
피드백: 입력 배열을 정렬하는 데 O(n log n)의 시간 복잡도가 소요되며, 이후 인접 구간을 한 번만 검사하므로 전체 시간은 O(n log n)입니다. 정렬은 제자리 정렬이 아니더라도, 공간 복잡도는 추가 공간 없이 정렬 가능하다고 가정하면 O(1)입니다.
개선 제안: 현재 구현이 적절해 보입니다.