Open
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.
[백준] 27497 알파벳블록
난이도 : 실버2
알고리즘 유형 : deque, stack
deque을 사용하여 문자열 만들고, stack을 사용하여 이력을 관리해 이전문자 제거시 stack을 pop해 처리해줌
[백준] 2310 어드벤처 게임
난이도 : 골드4
알고리즘 유형 : dfs, bfs
갓예은님 리뷰보고 힌트얻어 해결함.
이 문제는 방문배열을 잘 정의하는것이 중요해보였다.
방문배열에 금액을 추가한 visited[n][501]을 만들어 해당 금액을 통과했었는지를 체크했다.
[백준] 20058 마법사 상어와 파이어스톰
난이도 : 골드3
알고리즘 유형 : 시뮬레이션
말그대로 구현했으나, 배열 돌리기시 원본배열 자체를 돌리고 싶었으나 끝없는 오류 발생으로 임시 배열을 생성하여 회전시킨 후 원본배열에 붙여넣는 방식으로 진행.