<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/longest-arithmetic-subsequence/description/">Longest Arithmetic Subsequence - LeetCode</a></p>
<h2 id="heading-code">Code</h2>
<p><a target="_blank" href="https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1027/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1027/main.fsx</a></p>
<pre><code class="lang-plaintext">open System

let longestArithSeqLength (nums: int list) : int =
    let rec longestArithSeqLength' (nums: int[]) i (dp: Map&lt;int, int&gt;[]) ret =
        if i &gt;= nums.Length then
            ret
        else
            let dp', acc' =
                seq { 0 .. (i - 1) }
                |&gt; Seq.fold
                    (fun ((dp: Map&lt;int, int&gt;[]), acc) j -&gt;
                        let diff = nums.[i] - nums.[j]

                        let prev =
                            match Map.tryFind diff dp.[j] with
                            | Some(v) -&gt; v
                            | None -&gt; 1

                        dp.[i] &lt;- Map.add diff (prev + 1) dp.[i]
                        let acc' = Math.Max(acc, prev + 1)
                        dp, acc')
                    (dp, ret)

            longestArithSeqLength' nums (i + 1) dp' acc'

    let nums' = List.toArray nums
    let dp = Array.init nums'.Length (fun _ -&gt; Map.empty)
    longestArithSeqLength' nums' 1 dp 0
</code></pre>


## URL

[Longest Arithmetic Subsequence - LeetCode](https://leetcode.com/problems/longest-arithmetic-subsequence/description/)

## Code

[https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1027/main.fsx](https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1027/main.fsx)

```plaintext
open System

let longestArithSeqLength (nums: int list) : int =
    let rec longestArithSeqLength' (nums: int[]) i (dp: Map<int, int>[]) ret =
        if i >= nums.Length then
            ret
        else
            let dp', acc' =
                seq { 0 .. (i - 1) }
                |> Seq.fold
                    (fun ((dp: Map<int, int>[]), acc) j ->
                        let diff = nums.[i] - nums.[j]

                        let prev =
                            match Map.tryFind diff dp.[j] with
                            | Some(v) -> v
                            | None -> 1

                        dp.[i] <- Map.add diff (prev + 1) dp.[i]
                        let acc' = Math.Max(acc, prev + 1)
                        dp, acc')
                    (dp, ret)

            longestArithSeqLength' nums (i + 1) dp' acc'

    let nums' = List.toArray nums
    let dp = Array.init nums'.Length (fun _ -> Map.empty)
    longestArithSeqLength' nums' 1 dp 0
```

LeetCode 1027. Longest Arithmetic Subsequence in F#

URL

Code