2023.03.28 Today's Challenge

https://leetcode.com/problems/minimum-cost-for-tickets

Minimum Cost For Tickets - LeetCode

DP 로 푸는 문제. DFS/BFS에서 DP 나오는걸로 바뀐 듯 ㅋㅋ

class Solution:
    def mincostTickets(self, days: List[int], costs: List[int]) -> int:
        dayset = set(days)
        durations = [1, 7, 30]

        @lru_cache(None)
        def dp(i):
            if i > 365:
                return 0
            elif i in dayset:
                return min(dp(i+d) + c for c, d in zip(costs, durations))
            else:
                return dp(i+1)
        
        return dp(1)