-
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
[KwonNayeon] Week 3 #766
[KwonNayeon] Week 3 #766
Conversation
for i in range(len(nums)): | ||
for j in range(i+1, len(nums)): | ||
if nums[j] == target - nums[i]: | ||
return [i, j] |
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²)보다 적은 시간복잡도를 갖는 풀이도 한번 해보셔도 도움 될 것 같습니다~
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.
@taewanseoul 님 리뷰 감사합니다. 시간복잡도를 줄이는 방법도 생각해볼게요!
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.
3문제 푸시느라 고생 많으셨습니다!
@DaleSeo 님 디스코드 통해서 스터디 격려해주셔서 감사합니다! |
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.