Skip to content
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

[jeldo3] Week5 #867

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

[jeldo3] Week5 #867

wants to merge 2 commits into from

Conversation

Jeldo
Copy link
Contributor

@Jeldo Jeldo commented Jan 7, 2025

답안 제출 문제

체크 리스트

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

@Jeldo Jeldo added the py label Jan 7, 2025
@Jeldo Jeldo self-assigned this Jan 7, 2025
@Jeldo Jeldo requested a review from a team as a code owner January 7, 2025 12:07
@Jeldo Jeldo requested a review from sungjinwi January 7, 2025 12:08
Copy link
Contributor

@sungjinwi sungjinwi left a comment

Choose a reason for hiding this comment

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

두 문제 다 간단하고 깔끔하게 구현하신것 같습니다



class Solution:
# O(n*mlogm), n = len(str), m = the length of the longest string
Copy link
Contributor

Choose a reason for hiding this comment

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

m을 가장 긴 문자열의 길이라고 하셨는데 n번 반복되는 sort에 곱하는 형태니까 문자열의 평균길이로 계산하는게 좀 더 실제 값에 근접할 거 같아요!!

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

Successfully merging this pull request may close these issues.

2 participants