<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/shortest-unsorted-continuous-subarray/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/shortest-unsorted-con..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0581/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">open System

let findUnsortedSubarray (nums: int list) : int =
    let sorted = nums |&gt; List.sort
    let len = nums.Length

    let vals =
        nums
        |&gt; List.zip sorted
        |&gt; List.mapi (fun i (a, b) -&gt; i, a, b)

    let left, right =
        vals
        |&gt; List.fold
            (fun (left, right) (i, a, b) -&gt;
                if a &lt;&gt; b then
                    (Math.Min(left, i)), (Math.Max(right, i))
                else
                    left, right)
            (len, 0)

    if left = len then
        0
    else
        right - left + 1
</code></pre>


## URL

https://leetcode.com/problems/shortest-unsorted-continuous-subarray/

## Code

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

```fsharp
open System

let findUnsortedSubarray (nums: int list) : int =
    let sorted = nums |> List.sort
    let len = nums.Length

    let vals =
        nums
        |> List.zip sorted
        |> List.mapi (fun i (a, b) -> i, a, b)

    let left, right =
        vals
        |> List.fold
            (fun (left, right) (i, a, b) ->
                if a <> b then
                    (Math.Min(left, i)), (Math.Max(right, i))
                else
                    left, right)
            (len, 0)

    if left = len then
        0
    else
        right - left + 1
```

LeetCode 581. Shortest Unsorted Continuous Subarray in F#

URL

Code