-
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
[BEMELON] WEEK 3 Solution #387
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.
2주차 건너띄고 3주차에 돌아오셨네요? ㅋㅋ 😆👍
for i in range(3, n + 1): | ||
# dp[n] = dp[n - 1] + dp[n - 2] | ||
# = dp[1] + dp[0] | ||
dp[(i - 1) % 2] = sum(dp) |
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.
혹시 v1 v2는 무슨 의미일까요?ㅎㅎ
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.
앗, Follow-up 까지 풀어보려고 버전을 나눴는데, 메소드 명을 조금 더 변경해봐야겠네요 ㅎ
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.
수고하셨습니다! 일찍 답안 제출해주셔서 감사합니다!
답안 제출 문제
체크 리스트
In Review
로 설정해주세요.