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

## Table of Contents

## Minimum Cost For Tickets

You have planned some train traveling one year in advance. The days of the year you will travel are given as an integer array days. Each day is an integer from 1 to 365.

Train tickets are sold in three different ways:

- a 1-day pass is sold for costs[0] dollars,
- a 7-day pass is sold for costs[1] dollars, and
- 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: 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.

## Constraints

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

## Solution

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 |
class Solution { public int mincostTickets(int[] days, int[] costs) { int[][] memo = new int[days.length+1][720]; for(int[] m: memo){ Arrays.fill(m, -1); } return dfs(days, costs, 0, 0, memo); } private int dfs(int[] days, int[] costs, int remainingDays, int index, int[][] memo){ if(index >= days.length){ return 0; } if(memo[index][remainingDays]!=-1){ return memo[index][remainingDays]; } int min = Integer.MAX_VALUE; if(remainingDays >= days[index]){ min = Math.min(min, dfs(days, costs, remainingDays, index+1, memo)); } else { for(int i=0;i<costs.length;i++){ min = Math.min(min, costs[i] + dfs(days, costs, days[index]+getDays(i), index+1, memo)); } } memo[index][remainingDays] = min; return min; } private int getDays(int index){ switch(index){ case 0: return 0; case 1: return 6; case 2: return 29; } return -1; } } |