<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-cost-for-tickets/description/">Minimum Cost For Tickets - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0983/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0983/main.fsx</a></p>
<pre><code class="lang-plaintext">open System

let mincostTickets (days: int list) ((cost1, cost7, cost30): (int * int * int)) : int =
    let rec mincostTickets' day travelDays cache =
        if day &gt; 365 then
            0, cache
        else
            match Map.tryFind day cache with
            | Some(v) -&gt; v, cache
            | None -&gt;
                if Set.contains day travelDays then
                    let ret1, cache1 = mincostTickets' (day + 1) travelDays cache
                    let ret7, cache7 = mincostTickets' (day + 7) travelDays cache1
                    let ret30, cache30 = mincostTickets' (day + 30) travelDays cache7

                    let ret = Math.Min(ret1 + cost1, Math.Min(ret7 + cost7, ret30 + cost30))
                    ret, Map.add day ret cache30
                else
                    mincostTickets' (day + 1) travelDays cache

    let travelDays = Set.ofList days
    mincostTickets' 1 travelDays Map.empty |&gt; fst
</code></pre>


## URL

[Minimum Cost For Tickets - LeetCode](https://leetcode.com/problems/minimum-cost-for-tickets/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0983/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0983/main.fsx)

```plaintext
open System

let mincostTickets (days: int list) ((cost1, cost7, cost30): (int * int * int)) : int =
    let rec mincostTickets' day travelDays cache =
        if day > 365 then
            0, cache
        else
            match Map.tryFind day cache with
            | Some(v) -> v, cache
            | None ->
                if Set.contains day travelDays then
                    let ret1, cache1 = mincostTickets' (day + 1) travelDays cache
                    let ret7, cache7 = mincostTickets' (day + 7) travelDays cache1
                    let ret30, cache30 = mincostTickets' (day + 30) travelDays cache7

                    let ret = Math.Min(ret1 + cost1, Math.Min(ret7 + cost7, ret30 + cost30))
                    ret, Map.add day ret cache30
                else
                    mincostTickets' (day + 1) travelDays cache

    let travelDays = Set.ofList days
    mincostTickets' 1 travelDays Map.empty |> fst
```

LeetCode 983. Minimum Cost For Tickets in F#

URL

Code