[BFS&DFS] 프로그래머스_타겟넘버
answer = 0 def dfs(idx, numbers, target, value): global answer if idx == len(numbers) and target == value: answer += 1 return if idx == len(numbers): return dfs(idx+1, numbers, target, value+numbers[idx]) dfs(idx+1, numbers, target, value-numbers[idx]) def solution(numbers, target): global answer value = 0 dfs(0, numbers, target, value) return answer
[BFS&DFS]백준_2178_미로탐색
from collections import deque n, m = map(int, input().split()) graph = [] for i in range(n): graph.append(list(map(int, input()))) # 상, 하, 좌, 우 dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(x, y): queue = deque() queue.append((x, y)) while queue: x, y = queue.popleft() for i in range(4): nx = x + dx[i] ny = y + dy[i] if nx = n or ny =m: continue if graph[nx][ny] == 0: conti..
