Created
August 19, 2021 02:40
-
-
Save inspirit941/1cf0ef8af0969d56f51c55f1086b6953 to your computer and use it in GitHub Desktop.
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
def solution(numbers, target): | |
answer = 0 | |
value = 0 | |
stack = [0] | |
for idx, number in enumerate(numbers,1): | |
temp = [] | |
while stack: | |
operator = stack.pop() | |
## 모든 숫자를 다 써서 타겟 넘버에 도달할 수 있는 경우 | |
if operator + number == target and idx == len(numbers): | |
answer += 1 | |
if operator - number == target and idx == len(numbers): | |
answer += 1 | |
temp.append(operator - number) | |
temp.append(operator + number) | |
stack = temp | |
return answer |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment