Package g0901_1000.s0983_minimum_cost_for_tickets

Class Solution

java.lang.Object

g0901_1000.s0983_minimum_cost_for_tickets.Solution

public class Solution
extends Object

983 - Minimum Cost For Tickets.<p>Medium</p> <p>You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array <code>days</code>. Each day is an integer from <code>1</code> to <code>365</code>.</p> <p>Train tickets are sold in <strong>three different ways</strong>:</p> <ul> <li>a <strong>1-day</strong> pass is sold for <code>costs[0]</code> dollars,</li> <li>a <strong>7-day</strong> pass is sold for <code>costs[1]</code> dollars, and</li> <li>a <strong>30-day</strong> pass is sold for <code>costs[2]</code> dollars.</li> </ul> <p>The passes allow that many days of consecutive travel.</p> <ul> <li>For example, if we get a <strong>7-day</strong> pass on day <code>2</code>, then we can travel for <code>7</code> days: <code>2</code>, <code>3</code>, <code>4</code>, <code>5</code>, <code>6</code>, <code>7</code>, and <code>8</code>.</li> </ul> <p>Return <em>the minimum number of dollars you need to travel every day in the given list of days</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> days = [1,4,6,7,8,20], costs = [2,7,15]</p> <p><strong>Output:</strong> 11</p> <p><strong>Explanation:</strong> For example, here is one way to buy passes that lets you travel your travel plan:</p> <p>On day 1, you bought a 1-day pass for costs[0] = $2, which covered day 1.</p> <p>On day 3, you bought a 7-day pass for costs[1] = $7, which covered days 3, 4, &hellip;, 9.</p> <p>On day 20, you bought a 1-day pass for costs[0] = $2, which covered day 20.</p> <p>In total, you spent $11 and covered all the days of your travel.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> days = [1,2,3,4,5,6,7,8,9,10,30,31], costs = [2,7,15]</p> <p><strong>Output:</strong> 17</p> <p><strong>Explanation:</strong> For example, here is one way to buy passes that lets you travel your travel plan:</p> <p>On day 1, you bought a 30-day pass for costs[2] = $15 which covered days 1, 2, &hellip;, 30.</p> <p>On day 31, you bought a 1-day pass for costs[0] = $2 which covered day 31.</p> <p>In total, you spent $17 and covered all the days of your travel.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= days.length <= 365</code></li> <li><code>1 <= days[i] <= 365</code></li> <li><code>days</code> is in strictly increasing order.</li> <li><code>costs.length == 3</code></li> <li><code>1 <= costs[i] <= 1000</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
static int	getNext(int[] days, int index, int goodUntil)
int	mincostTickets(int[] days, int[] costs)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

mincostTickets

public int mincostTickets(int[] days,
 int[] costs)

getNext

public static int getNext(int[] days,
 int index,
 int goodUntil)