<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/minimum-path-sum/description/">Minimum Path Sum - 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/0064/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/0064/main.fsx</a></p>
<pre><code class="lang-plaintext">open System

let minPathSum (grid: int[,]) : int =
    let rows, cols = Array2D.length1 grid, Array2D.length2 grid
    let dp = Array2D.init rows cols (fun _ _ -&gt; Int32.MaxValue)
    dp.[0, 0] &lt;- grid.[0, 0]

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

            if j &lt;&gt; 0 then
                dp.[i, j] &lt;- Math.Min(dp.[i, j], grid.[i, j] + dp.[i, j - 1])


    dp.[rows - 1, cols - 1]
</code></pre>


## URL

[Minimum Path Sum - LeetCode](https://leetcode.com/problems/minimum-path-sum/description/)

## Code

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

```plaintext
open System

let minPathSum (grid: int[,]) : int =
    let rows, cols = Array2D.length1 grid, Array2D.length2 grid
    let dp = Array2D.init rows cols (fun _ _ -> Int32.MaxValue)
    dp.[0, 0] <- grid.[0, 0]

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

            if j <> 0 then
                dp.[i, j] <- Math.Min(dp.[i, j], grid.[i, j] + dp.[i, j - 1])


    dp.[rows - 1, cols - 1]
```

Shohei Yoshida's Blog

Shohei Yoshida's Blog

LeetCode 64. Minimum Path Sum in F#

URL

Code