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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 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.
🧷 문제 링크
김밥천국의 계단
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
i번째 칸에서i + 1,i + i / 2칸으로 이동할 수 있을 때N번째 칸에K번 만에 도달 가능?🔍 풀이 방법
일단 bfs로 풀긴 함
방문 배열 2차원으로 하면 메모리 터져서 int 배열에 cnt 횟수 저장함
근데 이거 dp잖아
⏳ 회고
그냥 처음부터 얌전히 dp로 풀 걸