-
Notifications
You must be signed in to change notification settings - Fork 126
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
[Tony] WEEK 13 Solutions #578
Conversation
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.
안녕하세요 토니님 :)
혹시 이 문제 푸신 걸까요?
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.
@obzva 헐 다른 문제 풀었네요 세상엨ㅋㅋㅋㅋ
다시 풀어서 올리겠습니다 ㅠㅠㅠ..
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.
한주간 고생 많으셨습니다!
@@ -0,0 +1,13 @@ | |||
// TC: O(h) | |||
// h = the high of binary search tree | |||
// SC: O(1) |
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.
스택 메모리를 고려해야 하지 않을까요~?
// only constant space necessary | ||
class Solution { | ||
public int eraseOverlapIntervals(int[][] intervals) { | ||
Arrays.sort(intervals, (o1, o2) -> Integer.compare(o1[1], o2[1])); |
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.
Comparator 를 다양하게 구현해주셔서 보는 입장에서도 한번 더 살펴볼 수 있어 좋은 것 같습니다!
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.
한 주 고생하셨습니다 ㅎㅎ
리더보드 프로젝트 병행하시는 분들은 많이 바쁘시겠어요
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.