<h2 id="heading-url">URL</h2>
<p><a href="https://leetcode.com/problems/unique-paths/" class="autolinkedURL autolinkedURL-url" target="_blank">leetcode.com/problems/unique-paths</a></p>
<h2 id="heading-code">Code</h2>
<p><a href="https://github.com/syohex/dotnet-study/blob/master/fsharp/leetcode/problems/0062/main.fsx" class="autolinkedURL autolinkedURL-url" target="_blank">github.com/syohex/dotnet-study/blob/master/..</a></p>
<pre><code class="lang-fsharp">let uniquePaths (m: int) (n: int) : int =
    let dp = Array2D.zeroCreate m n
    dp.[0, 0] &lt;- 1

    for i in 0 .. (m - 1) do
        for j in 0 .. (n - 1) do
            if i &lt;&gt; 0 then
                dp.[i, j] &lt;- dp.[i, j] + dp.[i - 1, j]

            if j &lt;&gt; 0 then
                dp.[i, j] &lt;- dp.[i, j] + dp.[i, j - 1]

    dp.[m - 1, n - 1]
</code></pre>


## URL

https://leetcode.com/problems/unique-paths/

## Code

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

```fsharp
let uniquePaths (m: int) (n: int) : int =
    let dp = Array2D.zeroCreate m n
    dp.[0, 0] <- 1

    for i in 0 .. (m - 1) do
        for j in 0 .. (n - 1) do
            if i <> 0 then
                dp.[i, j] <- dp.[i, j] + dp.[i - 1, j]

            if j <> 0 then
                dp.[i, j] <- dp.[i, j] + dp.[i, j - 1]

    dp.[m - 1, n - 1]
```

LeetCode 62. Unique Paths in F#

URL

Code