NeetCode #681LC-983Medium1-D Dynamic Programming
← Back to All Problems#681 · #983 · Minimum Cost For Tickets(最低票价)
📌 Problem Statement & Constraints
You are given
days, the days of the year on which you travel, and costs = [cost1, cost7, cost30] for 1-day, 7-day, and 30-day passes. Return the minimum cost to cover all travel days. Constraints: 1 <= days.length <= 365, 1 <= days[i] <= 365 and strictly increasing, 1 <= costs[i] <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!