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.
🧷 문제 링크
사다리 조작
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
사다리 가로선을 3개까지 놓을 수 있음
이미 놓여있는 가로선은 카운트 X
i번째 세로선에서 출발했을 때 도착지가i가 되도록 조작할 때 놓을 수 있는 가로선의 최솟값🔍 풀이 방법
3까지만 백트래킹
ladder[h][n]에 가로선을 놓았으면n+1에는 놓을 수 없으므로 건너뛰기⏳ 회고
처음에는 무지성 완탐했는데 시간초과 나서 3까지만 확인함,,