983. 最低票价

最新推荐文章于 2024-10-20 21:47:05 发布

循环是人递归是神

最新推荐文章于 2024-10-20 21:47:05 发布

阅读量97

点赞数

分类专栏： Leetcode 动态规划 DFS

本文链接：https://blog.csdn.net/qq_35752161/article/details/105955479

版权

Leetcode 同时被 3 个专栏收录

67 篇文章 0 订阅

订阅专栏

DFS

16 篇文章 0 订阅

订阅专栏

动态规划

14 篇文章 0 订阅

订阅专栏

动态规划

    int mincostTickets(vector<int>& days, vector<int>& costs) {
        
        int dp[368];
        memset(dp,0x3f,sizeof(dp));
        dp[0] = 0;
        int days_idx = 0;
        for(int i = 1;i <= days.back();i++)
        {
            if(i != days[days_idx])
            {
                dp[i] = dp[i-1];
                continue;
            }
            dp[i] = min(min(dp[max(0,i-1)]+costs[0],dp[max(0,i-7)]+costs[1]),dp[max(0,i-30)]+costs[2]);
            days_idx++;

        }
        return dp[days.back()];
    }

dfs

    vector<int> day,cost;
    int dp[366],vis[366];
    int mincostTickets(vector<int>& days, vector<int>& costs){
        day = days,cost = costs; 
        for(int d:days)
            vis[d] = 1;
        return dfs(1);    
    }
    int dfs(int cur) {
        
        while(cur <= day.back() && vis[cur] == 0) 
            cur++;
        if(cur > day.back()) 
            return 0;
        if(dp[cur] != 0) 
            return dp[cur];

        int cost1 = cost[0] + dfs(cur+1);
        int cost2 = cost[1] + dfs(cur+7);
        int cost3 = cost[2] + dfs(cur+30);

        dp[cur] = min(cost1, min(cost2, cost3));
        
        return dp[cur];
    }