LeetCode 983: Minimum Cost For Tickets Solution

Master LeetCode problem 983 (Minimum Cost For Tickets), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

983. Minimum Cost For Tickets

Problem Explanation

Explanation

To solve this problem, we can use dynamic programming. We will create a dp array to store the minimum cost to travel up to each day. We will then iterate through each day and calculate the cost for each type of pass (1-day, 7-day, 30-day) and update the dp array accordingly. At the end, the minimum cost to travel all days will be stored in dp[days[days.length - 1]].

Time complexity: O(n) where n is the number of days Space complexity: O(n)

Solution Code

class Solution {
    public int mincostTickets(int[] days, int[] costs) {
        int[] dp = new int[days[days.length - 1] + 1];
        boolean[] travelDays = new boolean[days[days.length - 1] + 1];
        
        for (int day : days) {
            travelDays[day] = true;
        }
        
        for (int i = 1; i < dp.length; i++) {
            if (!travelDays[i]) {
                dp[i] = dp[i - 1];
            } else {
                dp[i] = Math.min(
                    dp[Math.max(0, i - 1)] + costs[0],
                    Math.min(
                        dp[Math.max(0, i - 7)] + costs[1],
                        dp[Math.max(0, i - 30)] + costs[2]
                    )
                );
            }
        }
        
        return dp[days[days.length - 1]];
    }
}

Try It Yourself

Loading code editor...

Related LeetCode Problems

Frequently Asked Questions

How to solve LeetCode 983 (Minimum Cost For Tickets)?

This page provides optimized solutions for LeetCode problem 983 (Minimum Cost For Tickets) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 983 (Minimum Cost For Tickets)?

The time complexity for LeetCode 983 (Minimum Cost For Tickets) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 983 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 983 in Java, C++, or Python.

Back to LeetCode Solutions