Skip to content

2회차 #3

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

Merged
merged 11 commits into from
Feb 12, 2023
Merged

2회차 #3

merged 11 commits into from
Feb 12, 2023

Conversation

102092
Copy link
Contributor

@102092 102092 commented Feb 9, 2023

문제

  • 백준 8문제
  • 추가 리트코드 문제 풀이

배운점

  • 기본적인 소팅 구현 방법
  • 개념정도만 어렴풋히 이해하고, 다시 한가지 소팅을 골라 구현해보라하면 구현 못할듯.
  • 기타 파이썬 라이브러리 사용법.

기타

  • 문제를 이해하고 수도코드를 정리하는데 시간을 좀 더 써야할듯 (현재 약 7분정도 소요하는듯 -> 10 ~ 12분정도까지)
  • 백준 8문제 + 리트코드 정도가 1사이클에 적당한듯 함.

@102092 102092 requested a review from MuseopKim February 9, 2023 14:07
@102092 102092 self-assigned this Feb 9, 2023
Copy link
Member

@MuseopKim MuseopKim left a comment

Choose a reason for hiding this comment

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

파이썬에서 제공하는 기능들을 잘 활용하셔서 코드 보면서 공부가 많이 됐습니다 👍
고생하셨습니다!

result = 0

for i in range(1, N + 1):
result += sum(P[0:i])
Copy link
Member

Choose a reason for hiding this comment

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

😮 파이썬은 이런식으로도 슬라이스를 할 수 있네요!

return

left_arr = arr[:len(arr) // 2]
right_arr = arr[len(arr) // 2:]
Copy link
Member

Choose a reason for hiding this comment

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

병합정렬을 중간 인덱스 없이 이렇게 표현할 수 있네요 👍

@102092 102092 merged commit c383e69 into main Feb 12, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants