-
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
[Helena] Week 9 #998
[Helena] Week 9 #998
Conversation
8fb2b3b
to
fb9f931
Compare
# min could be mid or in the left part | ||
high = mid | ||
# low and high converge to the minimum element | ||
return nums[low] |
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.
저도 같은 방식으로 풀었어요! 주석을 꼼꼼히 달아주셔서, 코드를 처음 읽는 사람도 알고리즘 풀이를 이해하기 쉬울 것 같습니다!
if suffix_product == 0: | ||
suffix_product = 1 | ||
|
||
return max_product |
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.
저는 각 위치에서 가능한 최소/최대값을 찾는 방식으로 문제를 풀었는데, 양쪽에서 곱해나가는 방식으로 풀 수도 있었네요! 공부가 되었습니다 ㅎㅎ
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.
@yolophg 님 풀이를 통해 새로운 방식에 대해서 알 수 있었습니다. 이번 주도 고생하셨습니다 👍
제가 지정된 리뷰어가 아닌데, 모르고 승인을 눌렀네요... 변경하는 법을 몰라서 이렇게 두겠습니다 😅
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.