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://school.programmers.co.kr/learn/courses/30/lessons/17679
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
블록이 2x2 형태로 4개가 붙어있을 경우 블록이 지워지고, 블록이 지워진 후에 위에 있는 블록이 아래로 떨어져 빈 공간을 채움
이것이 반복될 때, 지워지는 블록의 개수 구하기
🔍 풀이 방법
지울 수 있는 블록이 있는지 확인하는 check함수를 통해 지워지는지 여부를 remove 배열에 저장해둠
이후, move를 시켜서 블록들의 위치를 이동시켜줌
더이상 지울 블록이 없을 때까지 무한 반복
⏳ 회고
단순 구현이다