[sangyyypark] WEEK 02 solutions #2073
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
geegong
reviewed
Nov 22, 2025
| @@ -0,0 +1,30 @@ | |||
| /** | |||
| 1. 문제 이해 | |||
| N이 주어지면 1부터 N까지의 숫자를 이용해서 N까지 도달 가능한 경우의 수(+1,+2만 가능)를 반환해야 하는 문제임. 중복을 허용하는 순열을 찾는 문제이다. | |||
Contributor
There was a problem hiding this comment.
오 문제를 풀기위해 이해과정을 서술한게 보기 좋네요👍
geegong
approved these changes
Nov 22, 2025
Contributor
geegong
left a comment
geegong
left a comment
There was a problem hiding this comment.
2주차 문제 푸시느라 고생 넘 많으셨습니다~ 👍
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
답안 제출 문제
작성자 체크 리스트
In Review로 설정해주세요.검토자 체크 리스트
Important
본인 답안 제출 뿐만 아니라 다른 분 PR 하나 이상을 반드시 검토를 해주셔야 합니다!