Conversation
This file contains 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
Open
hanby-choi
approved these changes
May 16, 2024
| int N, M; | ||
| int visited_count; | ||
| int map[MAX][MAX]; // 지도 | ||
| int visited[MAX][MAX] = { |
There was a problem hiding this comment.
P3: 맵 데이터를 저장할 배열과 방문 표시를 할 배열을 따로 선언해 문제를 풀어주셨네요. 그런데 맵 데이터 저장 배열에 0과 1이 아닌 임의의 숫자(예를 들어 2)로 방문 체크를 한다면 배열 하나만으로도 해결할 수 있어요! 이 문제는 한 변의 길이가 최대 50이기 때문에 메모리 차지가 크지 않지만, 입출력 범위가 큰 경우를 고려해 배열 하나만을 이용해서 푸는 방법도 고려해주시면 좋을 것 같습니다~
| // 북, 동, 남, 서 | ||
| int dx[4] = { -1, 0, 1, 0 }; | ||
| int dy[4] = { 0, 1, 0, -1 }; | ||
| int r, c, d; |
There was a problem hiding this comment.
P3: 문제에서 사용할 변수들을 전역으로 선언해주셨네요! 가급적 main함수 안에 선언하고 재귀함수에는 매개변수로 넘겨주는 것을 권장드립니다~
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.
이름: 문재원
학번: 2276107
##과제제출
기존제출: 14503, 20922
추가제출: 20503