<h2 id="heading-url">URL</h2>
<a target="_blank" href="https://leetcode.com/problems/partition-list/description/">Partition List - LeetCode</a>
<h2 id="heading-code">Code</h2>
<a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202308/partition_list/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202308/partition_list/main.fsx</a>
<pre><code class="lang-fsharp">type ListNode =
 | Leaf
 | Node of int * ListNode

let partition (head: ListNode) (x: int) : ListNode =
 let rec listToListNode nums =
 match nums with
 | [] -&gt; Leaf
 | h :: t -&gt; Node(h, listToListNode t)

 let rec partition' node x acc1 acc2 =
 match node with
 | Leaf -&gt; listToListNode ((List.rev acc1) @ (List.rev acc2))
 | Node(v, next) -&gt;
 if v &lt; x then
 partition' next x (v :: acc1) acc2
 else
 partition' next x acc1 (v :: acc2)

 partition' head x [] []
</code></pre>

## URL

[Partition List - LeetCode](https://leetcode.com/problems/partition-list/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202308/partition\_list/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/challenge/202308/partition_list/main.fsx)

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

let partition (head: ListNode) (x: int) : ListNode =
 let rec listToListNode nums =
 match nums with
 | [] -> Leaf
 | h :: t -> Node(h, listToListNode t)

 let rec partition' node x acc1 acc2 =
 match node with
 | Leaf -> listToListNode ((List.rev acc1) @ (List.rev acc2))
 | Node(v, next) ->
 if v < x then
 partition' next x (v :: acc1) acc2
 else
 partition' next x acc1 (v :: acc2)

 partition' head x [] []
```

LeetCode 86. Partition List in F#

URL

Code