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.

Sign up for GitHub

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

Jump to bottom

[Chaedie] Week 9 #996

Merged
merged 5 commits into from
Feb 8, 2025
Merged

[Chaedie] Week 9 #996

merged 5 commits into from
Feb 8, 2025
+134 −0

Conversation

Chaedie
Copy link
Contributor

@Chaedie Chaedie commented Feb 7, 2025 •
edited
Loading

답안 제출 문제

체크 리스트

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

@Chaedie Chaedie requested a review from a team as a code owner February 7, 2025 03:19
@github-actions github-actions bot added the py label Feb 7, 2025
@Chaedie Chaedie requested a review from pmjuu February 7, 2025 03:20
obzva
obzva approved these changes Feb 7, 2025
View reviewed changes
Copy link
Contributor

@obzva obzva left a comment

Choose a reason for hiding this comment

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

안녕하세요 Chadie님 :)
9주차도 수고 많으셨습니다
아직 풀이 중이신 것 같지만 미리 approve 남겨놓겠습니다

find-minimum-in-rotated-sorted-array/Chaedie.py
Solution:
1) 순회하며 이전 값이 현재 값보다 크거나 같다면 현재 값이 최소값이다.
2) 끝까지 돌아도 최소값이 없을 경우 첫번쨰 값이 최소값이다.
Time: O(n)
Copy link
Contributor

Choose a reason for hiding this comment

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

문제 조건에 이런게 있습니다 😔

You must write an algorithm that runs in O(log n) time.

이 문제의 난이도가 medium인 이유..

Copy link
Contributor Author

Choose a reason for hiding this comment

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

헛... 해당 조건을 놓쳤네요 감사합니다.. 이게 medium이라고? 하면서 풀었네요.. 😅

Copy link
Contributor Author

Choose a reason for hiding this comment

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

binary search 풀이도 추가했습니다..!

@Chaedie Chaedie merged commit f0b4b5e into DaleStudy:main Feb 8, 2025
1 check passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@obzva obzva obzva approved these changes

@pmjuu pmjuu Awaiting requested review from pmjuu

Assignees

@Chaedie Chaedie

Labels
py
Projects
리트코드 스터디 3기
Status: Completed
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@Chaedie @obzva