[20250914] BOJ / G5 / 0 만들기 / 김민진 #888
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
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.
🧷 문제 링크
0 만들기
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
입력받은
N에 대해+,-,0을 만들 수 있는 모든 경우의 수 출력하기🔍 풀이 방법
백트래킹,,
공백 나오면 숫자 계속 자릿수 올려준 다음
nums배열에 저장공백 처리 끝나면
nums랑ops확인하면서 계산 진행결과가
0인 경우 출력각 테스트케이스마다 개행으로 구분해야 하며 ASCII Code 순서대로 출력해야 함
그래서 공백부터 확인해야함
⏳ 회고
백트래킹 어려웡