<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/pascals-triangle/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/pascals-triangle</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0118/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let generate (numRows: int) : int list list =
    let rec generate' i limit (prev: int []) acc =
        if i &gt;= limit then
            acc |&gt; List.rev
        else
            let v =
                seq { 0..i }
                |&gt; Seq.fold
                    (fun acc j -&gt;
                        if j = 0 || j = i then
                            1 :: acc
                        else
                            (prev.[j - 1] + prev.[j]) :: acc)
                    []
                |&gt; List.rev

            generate' (i + 1) limit (v |&gt; List.toArray) (v:: acc)

    generate' 0 numRows [||] []
</code></pre>


## URL

https://leetcode.com/problems/pascals-triangle/

## Code

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

```fsharp
let generate (numRows: int) : int list list =
    let rec generate' i limit (prev: int []) acc =
        if i >= limit then
            acc |> List.rev
        else
            let v =
                seq { 0..i }
                |> Seq.fold
                    (fun acc j ->
                        if j = 0 || j = i then
                            1 :: acc
                        else
                            (prev.[j - 1] + prev.[j]) :: acc)
                    []
                |> List.rev

            generate' (i + 1) limit (v |> List.toArray) (v:: acc)

    generate' 0 numRows [||] []
```

LeetCode 118. Pascal's Triangle in F#

URL

Code