-
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
[sun]WEEK 2 Solution #348
[sun]WEEK 2 Solution #348
Conversation
sun912
commented
Aug 19, 2024
•
edited
Loading
edited
- Valid Anagram
- Counting Bits
- Encode and Decode Strings
- Construct Binary Tree From Preorder And Inorder Traversal
- Decode Ways
valid-anagram/sun912.py
Outdated
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.
리뷰 감사합니다!! 복잡도 반영했습니다=)
시간이 많이 남았으니 나머지 문제들도 시간이 되신다면 풀어보시는거도 좋을거같습니다! |
@@ -0,0 +1,19 @@ | |||
""" | |||
TC: O(n) | |||
SC: O(n) |
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.
공간 복잡도를 구하실 때 재귀 함수에서 매번 새로운 inorder 배열을 복제하는 부분을 고려하신 걸까요?
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.
아니요 잘못 파악했어요!!
달레님이 제공해주신 마약을 보고 깨달았습니다!
인덱스를 넘겨주면 SC 관점에서 좀 더 개선할 수 있다는 점요=)
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.
고생하셨습니다. PR 병합 부탁드립니다.