-
-
Notifications
You must be signed in to change notification settings - Fork 195
[gmlwls96] week9 #987
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
[gmlwls96] week9 #987
Conversation
when{ | ||
nums[mid-1] > nums[mid] -> { | ||
return nums[mid] | ||
} | ||
nums[0] < nums[mid] -> { | ||
left = mid + 1 | ||
} | ||
else -> { | ||
right = mid -1 | ||
} | ||
} |
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.
조금만 더 생각해 보시면 3개의 조건이 아닌 2가지 조건으로도 가능할 거에요 :)
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.
set을 사용하여 중복검사를 통해 문제 풀어주셨네요 :)
해당 문제는 LinkedList 의 특성을 살려서 푸는게 키포인트라 생각됩니다.
set을 사용하지 않고 풀려면 어떻게 하면 좋을지 한번 도전해보시면 좋을것 같습니다!
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.
오.........사실 해당 문제는 binary search와 sliding window를 사용하여 푸는 문제인데요, 로직 구현에 상당히 공을 들이셨을것 같습니다. 고생하셨습니다!
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.
9주차 문제 풀이 고생 많으셨습니다!
문제들 풀이에 고생을 많이 하신게 느껴지는 리뷰였습니다.
10주차 문제 풀이도 파이팅입니다!!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.