-
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
[donghyeon95] Week 1 #701
[donghyeon95] Week 1 #701
Conversation
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.
전반적으로 고민 많이 하시면서 문제 잘 해결하신 것 같습니다!
제 수준에서는 커멘트 드릴 내용이 없어보여요ㅎㅎ.. 푸신 내용 잘봤습니다 고생하셨습니다 :)
result = Math.max(recurse(nums, index+2)+nums[index], result); | ||
|
||
// 나를 선택하지 않는 경우, | ||
result = Math.max(recurse(nums, index+1), result); |
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.
반갑습니다 동훈님.
재귀 말고 반복문으로 푸는 게 성능 상 이점이 있을 거 같은데
시간이 없어서 못 해본 게 아쉽습니다.
리뷰 감사드리고, 3기 화이팅입니다.
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.