[20251008] BOJ / G5 / 배열 돌리기 1 / 이준희 #1065
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://www.acmicpc.net/problem/16926
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
2차원 배열을 반시계 방향으로 R 번 돌린 결과를 출력하는 문제입니다.
🔍 풀이 방법
깡으로 구현했습니다.
레이어의 갯수를 파악한 후 각 레이어 마다
위, 아래, 왼쪽, 오른쪽을 각각 반시계 방향으로 돌렸습니다.
⏳ 회고
일단 깡으로 구현하고 시간초과 나면 처리하려 그랬는데 바로 통과했습니다.