<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/delete-the-middle-nod..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/2095/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">type MyList =
    | Leaf
    | Node of int * MyList

let deleteMiddle (head: MyList) : MyList =
    let rec deleteMiddle' node i =
        match node with
        | Leaf -&gt; i, Leaf
        | Node (v, next) -&gt;
            let len, lst = deleteMiddle' next (i + 1)

            if i = (len / 2) then
                len, next
            else
                len, Node(v, lst)

    deleteMiddle' head 0 |&gt; snd
</code></pre>


## URL

https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/

## Code

https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/2095/main.fsx

```fsharp
type MyList =
    | Leaf
    | Node of int * MyList

let deleteMiddle (head: MyList) : MyList =
    let rec deleteMiddle' node i =
        match node with
        | Leaf -> i, Leaf
        | Node (v, next) ->
            let len, lst = deleteMiddle' next (i + 1)

            if i = (len / 2) then
                len, next
            else
                len, Node(v, lst)

    deleteMiddle' head 0 |> snd
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 2095. Delete the Middle Node of a Linked List in F#

URL

Code