-
-
Notifications
You must be signed in to change notification settings - Fork 195
[Sung-Heon]WEEK 02 solution #1263
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
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.
모든 값이 양수라면 합이 0이 될 수 없으니 먼저 처리해봐도 좋겠어요!
for i in s: | ||
if len(t) == 0: | ||
return False | ||
t.remove(i) |
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.
구글링해보니 list.move() 메서드에서 0(n) 시간이 걸려서 시간 복잡도 측면에서 다른 방법을 고안해봐도 좋을것같아요!
답안 제출 문제
작성자 체크 리스트
In Review
로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!