983

983. Minimum Cost For Tickets (Medium)

In a country popular for train travel, you have planned some train travelling one year in advance.  The days of the year that you will travel is given as an array days.  Each day is an integer from 1 to 365.

Train tickets are sold in 3 different ways:

• a 1-day pass is sold for costs[0] dollars;
• a 7-day pass is sold for costs[1] dollars;
• a 30-day pass is sold for costs[2] dollars.

The passes allow that many days of consecutive travel.  For example, if we get a 7-day pass on day 2, then we can travel for 7 days: day 2, 3, 4, 5, 6, 7, and 8.

Return the minimum number of dollars you need to travel every day in the given list of days.

 

Example 1:

Input: days = [1,4,6,7,8,20], costs = [2,7,15]
Output: 11
Explanation: 
For example, here is one way to buy passes that lets you travel your travel plan:
On day 1, you bought a 1-day pass for costs[0] = $2, which covered day 1.
On day 3, you bought a 7-day pass for costs[1] = $7, which covered days 3, 4, ..., 9.
On day 20, you bought a 1-day pass for costs[0] = $2, which covered day 20.
In total you spent $11 and covered all the days of your travel.

Example 2:

Input: days = [1,2,3,4,5,6,7,8,9,10,30,31], costs = [2,7,15]
Output: 17
Explanation: 
For example, here is one way to buy passes that lets you travel your travel plan:
On day 1, you bought a 30-day pass for costs[2] = $15 which covered days 1, 2, ..., 30.
On day 31, you bought a 1-day pass for costs[0] = $2 which covered day 31.
In total you spent $17 and covered all the days of your travel.

 

Note:

1. 1 <= days.length <= 365
2. 1 <= days[i] <= 365
3. days is in strictly increasing order.
4. costs.length == 3
5. 1 <= costs[i] <= 1000

Related Topics:
Dynamic Programming

Similar Questions:

• Coin Change (Medium)

Solution 1. DP Top-down

// OJ: https://leetcode.com/problems/minimum-cost-for-tickets/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class Solution {
    vector<int> m;
    int dp(vector<int> &days, vector<int>& costs, int i) {
        int N = days.size();
        if (i == N) return 0;
        if (m[i] != INT_MAX) return m[i];
        int ans = dp(days, costs, i + 1) + costs[0], j = i;
        while (j < N && days[j] < days[i] + 7) ++j;
        ans = min(ans, dp(days, costs, j) + costs[1]);
        while (j < N && days[j] < days[i] + 30) ++j;
        ans = min(ans, dp(days, costs, j) + costs[2]);
        return m[i] = ans;
    }
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        m.assign(days.size(), INT_MAX);
        return dp(days, costs, 0);
    }
};

Solution 2. DP Bottom-up

// OJ: https://leetcode.com/problems/minimum-cost-for-tickets/
// Author: github.com/lzl124631x
// Time: O(N)
// Space: O(N)
class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        int N = days.size();
        vector<int> dp(N + 1);
        for (int i = N - 1; i >= 0; --i) {
            dp[i] = min({ dp[i + 1] + costs[0],
                          dp[lower_bound(begin(days) + i, end(days), days[i] + 7) - begin(days)] + costs[1],
                          dp[lower_bound(begin(days) + i, end(days), days[i] + 30) - begin(days)] + costs[2] });
        }
        return dp[0];
    }
};

Another version which is from left to right and push the data to the next state.

class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        int N = days.size();
        vector<int> dp(N + 1, INT_MAX);
        dp[0] = 0;
        for (int i = 0; i < N; ++i) {
            dp[i + 1] = min(dp[i + 1], dp[i] + costs[0]);
            for (int j = 1; j < 3; ++j) {
                int d = j == 1 ? 7 : 30;
                int k = lower_bound(begin(days), end(days), days[i] + d) - begin(days);
                dp[k] = min(dp[k], dp[i] + costs[j]);
            }
        }
        return dp[N];
    }
};