[20250831] PGM / LV3 / 등굣길 / 김수연 #787
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
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분
👀 체감 난이도
✏️ 문제 설명
격자의 크기 m, n과 물이 잠긴 지역의 좌표를 담은 2차원 배열이 주어질 때,
오른쪽과 아래쪽으로만 움직여 집에서 학교까지 갈 수 있는 최단경로의 개수 구하기
🔍 풀이 방법
dp사용
dp[i][j] = (dp[i][j] + dp[i][j-1]) % 1000000007;
dp[i][j] = (dp[i][j] + dp[i-1][j]) % 1000000007;
오른쪽과 아래쪽으로 각각 움직일 때 가능한 경우 수를 dp배열에 저장해둠
⏳ 회고
기본적인 dp다