<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/queue-reconstruction-by-height/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/queue-reconstruction-..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0406/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let reconstructQueue (people: (int * int) list) : (int * int) list =
    let insert pos person queue =
        if pos = 0 then
            person :: queue
        else
            (List.take pos queue)
            @ (person :: (List.skip pos queue))


    let people' =
        people
        |&gt; List.sortWith (fun (h1, t1) (h2, t2) -&gt;
            if h1 = h2 then
                compare t1 t2
            else
                compare h2 h1)

    people'
    |&gt; List.fold
        (fun acc person -&gt;
            let (_, tallers) = person
            insert tallers person acc)
        []
</code></pre>


## URL

https://leetcode.com/problems/queue-reconstruction-by-height/

## Code

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

```fsharp
let reconstructQueue (people: (int * int) list) : (int * int) list =
    let insert pos person queue =
        if pos = 0 then
            person :: queue
        else
            (List.take pos queue)
            @ (person :: (List.skip pos queue))


    let people' =
        people
        |> List.sortWith (fun (h1, t1) (h2, t2) ->
            if h1 = h2 then
                compare t1 t2
            else
                compare h2 h1)

    people'
    |> List.fold
        (fun acc person ->
            let (_, tallers) = person
            insert tallers person acc)
        []
```

LeetCode 406. Queue Reconstruction by Height in F#

URL

Code