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
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.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/42895
🧭 풀이 시간
50분
👀 체감 난이도
✏️ 문제 설명
N과 사칙연산만 이용해서 number 만들 수 있는 방법 중 최솟값 구하기 (최솟값 8보다 크면 -1 return)
🔍 풀이 방법
8번을 돌리면서 특정수를 넣고, HashSet으로 이루어진 list에 저장함
그리고 리스트에 저장되어 있는 HashSet들에 대한 4개의 연산결과를 다시 넣고 number가 포함되어 있는지 확인
⏳ 회고
어렵다..