Skip to content

Conversation

KwonNayeon
Copy link
Contributor

@KwonNayeon KwonNayeon commented Dec 22, 2024

답안 제출 문제

체크 리스트

  • 우측 메뉴에서 PR을 Projects에 추가해주세요.
  • Projects의 오른쪽 버튼(▼)을 눌러 확장한 뒤, Week를 현재 주차로 설정해주세요.
  • 바로 앞에 PR을 열어주신 분을 코드 검토자로 지정해주세요.
  • 문제를 모두 푸시면 프로젝트에서 StatusIn Review로 설정해주세요.
  • 코드 검토자 1분 이상으로부터 승인을 받으셨다면 PR을 병합해주세요.

@KwonNayeon KwonNayeon requested a review from GangBean December 22, 2024 22:43
@KwonNayeon KwonNayeon requested a review from a team as a code owner December 22, 2024 22:43
@github-actions github-actions bot added the py label Dec 22, 2024
@KwonNayeon KwonNayeon requested review from taewanseoul and removed request for GangBean December 22, 2024 22:45
Comment on lines +22 to +25
for i in range(len(nums)):
for j in range(i+1, len(nums)):
if nums[j] == target - nums[i]:
return [i, j]
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

깔끔하게 풀어주셨군요!

한편 O(n²)보다 적은 시간복잡도를 갖는 풀이도 한번 해보셔도 도움 될 것 같습니다~

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

@taewanseoul 님 리뷰 감사합니다. 시간복잡도를 줄이는 방법도 생각해볼게요!

Copy link
Member

@DaleSeo DaleSeo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

3문제 푸시느라 고생 많으셨습니다!

@KwonNayeon KwonNayeon merged commit 439086a into DaleStudy:main Dec 28, 2024
1 check passed
@KwonNayeon
Copy link
Contributor Author

@DaleSeo 님 디스코드 통해서 스터디 격려해주셔서 감사합니다!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
No open projects
Status: Completed
Development

Successfully merging this pull request may close these issues.

3 participants