-
Notifications
You must be signed in to change notification settings - Fork 125
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
[친환경사과] Week 11 #1033
[친환경사과] Week 11 #1033
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.
오.... dfs에서 return시 depth - 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.
문제 풀이 방법에 투 포인터를 사용하신게 참신하네요!
해당 문제는 LinkedList 를 적극적으로 활용하는 문제라고 생각이 됩니다!
공간 복잡도를 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.
11주차 문제 풀이 고생하셨습니다!
Reorder List 문제 풀이를 한번 더 LinkedList를 활용하여 해보시면 너무 좋을것 같습니다.
미리 appove 남겨 드릴테니 천천히 풀어보시면 어떨까요?
12주차 문제 풀이도 파이팅입니다!
* */ | ||
|
||
/* | ||
* 첫 번째 풀이. 틀림 |
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.
저도 Interval 문제가 진짜 어렵더라구요 ㅠ
이번주차도 고생하셨습니다 👍
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.