<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/merge-sorted-array/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/merge-sorted-array</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0088/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let merge (nums1: int []) (m: int) (nums2: int []) (n: int) : unit =
    let rec merge' (nums1: int []) (m: int) (nums2: int []) (n: int) : int [] =
        if m = 0 &amp;&amp; n = 0 then
            nums1
        else
            let index = m + n - 1

            match m &gt; 0, n &gt; 0 with
            | true, true -&gt;
                if nums1.[m - 1] &gt;= nums2.[n - 1] then
                    nums1.[index] &lt;- nums1.[m - 1]
                    merge' nums1 (m - 1) nums2 n
                else
                    nums1.[index] &lt;- nums2.[n - 1]
                    merge' nums1 m nums2 (n - 1)
            | true, false -&gt;
                nums1.[index] &lt;- nums1.[m - 1]
                merge' nums1 (m - 1) nums2 n
            | false, true -&gt;
                nums1.[index] &lt;- nums2.[n - 1]
                merge' nums1 m nums2 (n - 1)
            | false, false -&gt; failwith "never reach here"

    let _ = merge' nums1 m nums2 n
    ()
</code></pre>


## URL

https://leetcode.com/problems/merge-sorted-array/

## Code

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

```fsharp
let merge (nums1: int []) (m: int) (nums2: int []) (n: int) : unit =
    let rec merge' (nums1: int []) (m: int) (nums2: int []) (n: int) : int [] =
        if m = 0 && n = 0 then
            nums1
        else
            let index = m + n - 1

            match m > 0, n > 0 with
            | true, true ->
                if nums1.[m - 1] >= nums2.[n - 1] then
                    nums1.[index] <- nums1.[m - 1]
                    merge' nums1 (m - 1) nums2 n
                else
                    nums1.[index] <- nums2.[n - 1]
                    merge' nums1 m nums2 (n - 1)
            | true, false ->
                nums1.[index] <- nums1.[m - 1]
                merge' nums1 (m - 1) nums2 n
            | false, true ->
                nums1.[index] <- nums2.[n - 1]
                merge' nums1 m nums2 (n - 1)
            | false, false -> failwith "never reach here"

    let _ = merge' nums1 m nums2 n
    ()
```

LeetCode 88. Merge Sorted Array in F#

URL

Code