알고리즘/프로그래머스
[파이썬][프로그래머스] 완전탐색 피로도
sang-rak
2022. 11. 29. 21:03
반응형
from itertools import permutations
def solution(k, dungeons):
answer = -1
dungeonsList = list(permutations(dungeons, len(dungeons)))
maxResult = 0
for dungeonList in dungeonsList:
useFatigue = 0
Result = 0
for dungeon in dungeonList:
if (k-useFatigue-dungeon[0]) >= 0:
useFatigue += dungeon[1]
Result += 1
if maxResult <= Result :
maxResult = Result
return maxResult
반응형