<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/longest-increasing-subsequence/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/longest-increasing-su..</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0300/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let lengthOfLis (nums: int list) : int =
    let numsA = nums |&gt; Array.ofList
    let dp = Array.init numsA.Length (fun _ -&gt; 1)
    let mutable ret = 1

    for i in 1 .. (numsA.Length - 1) do
        for j in 0 .. (i - 1) do
            if numsA.[j] &lt; numsA.[i] then
                dp.[i] &lt;- System.Math.Max(dp.[i], dp.[j] + 1)

        ret &lt;- System.Math.Max(ret, dp.[i])

    ret
</code></pre>


## URL

https://leetcode.com/problems/longest-increasing-subsequence/

## Code

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

```fsharp
let lengthOfLis (nums: int list) : int =
    let numsA = nums |> Array.ofList
    let dp = Array.init numsA.Length (fun _ -> 1)
    let mutable ret = 1

    for i in 1 .. (numsA.Length - 1) do
        for j in 0 .. (i - 1) do
            if numsA.[j] < numsA.[i] then
                dp.[i] <- System.Math.Max(dp.[i], dp.[j] + 1)

        ret <- System.Math.Max(ret, dp.[i])

    ret
```

LeetCode 300. Longest Increasing Subsequence in F#

URL

Code