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/49994
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
5x5 격자무늬 지도가 있음.
사용자가 상하좌우로 이동할거임.
이때 갔던 길의 개수를 출력.
이동하는 길이 중복하는 건 안셈
🔍 풀이 방법
set에 처음 위치 -> 다음 위치와 다음 위치 -> 처음 위치를 이동할때 쌍으로 집어넣음.
마지막에 set의 크기를 2로 나눔.
⏳ 회고
ez