Minimum Cost For Tickets

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

题目理解：

给定三种旅行方式，1日游，7日游，30日游，可以在一年中的任意一段时间进行旅游，和三种方式的价格。给定一系列日期，问要使旅游时间覆盖给定的所有日期，花费的最少价格是多少

解题思路：

贪心算法。遍历给定的所有日期，在每一天都尝试所有的旅游方式，那么当前的总的花费就是覆盖之前所有日期的最少花费，加上当前旅游方式的花费，从该天开始，被当前旅游方式所覆盖的日期的花费都可以是当前总的花费。如果当前花费比已经记录的花费要少，那么更新该天的最小花费

class Solution {
    public int mincostTickets(int[] days, int[] costs) {
        int len = days.length;
        int[] record = new int[len + 1];
        Arrays.fill(record, Integer.MAX_VALUE);
        record[0] = 0;
        for(int i = 1; i < len + 1; i++){
            record[i] = Math.min(record[i], record[i - 1] + costs[0]);
            for(int j = 0; i + j - 1 < len && days[i + j - 1] < days[i - 1] + 7; j++){
                record[i + j] = Math.min(record[i + j], record[i - 1] + costs[1]);
            }
            for(int j = 0; i + j - 1 < len && days[i + j - 1] < days[i - 1] + 30; j++){
                record[i + j] = Math.min(record[i + j], record[i - 1] + costs[2]);
            }
        }
        return record[len];
    }
}