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
1 participant
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/11559
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
뿌요뿌요 게임을 구현하는 문제입니다.
🔍 풀이 방법
bfs를 이용하여 4개 이상 붙어있는 것을 터트리고
이에 따른 연쇄적인 뿌요뿌요를 구현하는 문제입니다.
한 턴에 터지는 것을 1연쇄라고 하고, 최종적으로 몇 연쇄인지 구하는 문제입니다.
⏳ 회고
내일부터는 프로그래머스를 풀어야할 것 같습니다.
오늘 코딩테스트에서 기본적인 Array.length에 () 붙혀서 삽질해서 기분이 안좋습니다