[20251015] PGM / LV2 / 타겟 넘버 / 강신지 #1130
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.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/43165
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
숫자 배열의 각 원소 앞에 + 또는 -를 붙여, 모든 조합 중에서 목표값을 만들 수 있는 경우의 수를 구하는 문제.
🔍 풀이 방법
모든 경우를 탐색하기 위해 dfs를 사용한다.
각 숫자마다 더하거나 빼는 두 가지 선택지를 탐색하고, 모든 숫자를 사용했을 때 합이 목표값과 같으면 1을 반환한다.
각 단계에서 두 탐색 결과를 더해 전체 경우의 수를 구한다.
⏳ 회고
입력 크기가 작아 DFS만으로도 충분히 빠름