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.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/42898
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
집부터 학교까지 오른쪽 또는 아래로만 한칸씩 움직이며 갈 때 최단 경로의 수를 구하라
단, 지나갈 수 없는 웅덩이가 존재함
🔍 풀이 방법
dp로 풀었다. 웅덩이가 위 또는 아래에 있는지를 조건으로 해 적절히 연산.
⏳ 회고
n이 행, m이 열임에 주의. 웅덩이 좌표를 (m, n)으로 주는데 dp[n][m]에 저장해야...