반응형 전체 글75 [파이썬][프로그래머스] 깊이/너비 우선 탐색(DFS/BFS) 타겟 넘버 def solution(numbers, target): temp = [] tempList = [] for n in numbers: if len(temp) == 0: temp.append(+n) temp.append(-n) else: for t in temp: tempList.append(t+n) tempList.append(t-n) temp = list(tempList) tempList = [] answer = temp.count(target) return answer 2023. 1. 11. [파이썬][프로그래머스] 동적계획법(Dynamic Programming) 정수 삼각형 def solution(triangle): answer = 0 reversed(triangle) temp = [] for i in range(len(triangle)-1, -1, -1): # temp 값 더한후 if temp != []: t = sumT(triangle[i], temp) else: t = triangle[i] # 원소가 2개 이상이라면 temp 값 구하기 if len(t) != 1: maxT = findMax(t) # temp가 있으면 에 최대 값 저장 temp = maxT # 만약 1개면 리턴 if len(t) == 1: return answer + t[0] return answer def sumT(t, temp): answer = [] for i in range(len(t)): ans.. 2023. 1. 3. [파이썬][프로그래머스] 탐욕법(Greedy) 구명보트 from collections import deque def solution(people, limit): answer = 0 people.sort(reverse=True) people = deque(people) while len(people) > 1: bigP = people.popleft() smallP = people.pop() if bigP + smallP 2022. 12. 19. [파이썬][프로그래머스] 탐욕법(Greedy) 체육복 def solution(n, lost, reserve): haveTrainning = [] lost.sort() reserve.sort() # 여유분이 있지만 잃어버린 학생 temp = [] for i in lost: if i in reserve: temp.append(i) for i in temp: lost.pop(lost.index(i)) reserve.pop(reserve.index(i)) for i in range(1, n+1): if i not in lost: haveTrainning.append(i) for i in lost: if (i-1) in reserve: reserve.pop(reserve.index(i-1)) haveTrainning.append(i) else: if (i+1) in.. 2022. 12. 2. 이전 1 2 3 4 ··· 19 다음 반응형