[프로그래머스] Level2_메뉴 리뉴얼
틀린 풀이 result_level = [] result = [] max_num = 0 def dfs(cnt, check, idx, count, orders): if cnt == count: calcul(check, orders) return for i in range(idx, len(check)): if not check[i]: check[i] = True dfs(cnt + 1, check, i, count, orders) check[i] = False def calcul(check, orders): global max_num test_str = "" count = 0 for i in range(len(check)): if check[i]: test_str += chr(65 + i) for o in or..
[프로그래머스] Level2_타겟 넘버
정답 코드 score = 0 number = [] target = 0 def dfs(sum, idx): global number, score, target if idx == len(number): if sum == target: score += 1 return 0 dfs(sum+number[idx], idx+1) dfs(sum-number[idx], idx+1) def solution(numbers, tar): global target, number number = numbers target = tar dfs(0, 0) return score 틀린 코드 result = [] def dfs(check, idx, cnt, nums, target): if cnt == len(nums): calcul(check..
[백준 / Python] 욕심쟁이 판다_1937
정답 코드 n = int(input()) data = [] dp = [[0 for _ in range(n)] for _ in range(n)] for _ in range(n): data.append(list(map(int, input().split()))) dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] def dfs(x, y): if dp[x][y]: return dp[x][y] dp[x][y] = 1 for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0
