{{ message }}
[9주차 / 조은채] 문제풀이#65
Merged
Merged
Conversation
eunchae01
added
BOJ
Closed
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.
행렬 테두리 회전하기 [O]
제 기준 거꾸로? 돈다고 생각하고 구현했어야 됐던 문제였습니다.
문자열 폭발 [O]
replace 함수를 쓰면 통과가 안됐고 stack으로 풀어야 했던 문제였습니다.
택배 배달과 수거하기 [O]
예전에 풀어 본 문제라 수월하게 풀 수 있었습니다.
처음 풀어봤을 때 배달을 하고 돌아오는 길에 수거하는 과정을 고려해야 한다고 생각해서 오래 걸렸었는데, 돌아오는 길에 수거하는 과정은 굳이 고려하지 않고 풀어도 됐던 문제였습니다.