<h2 id="heading-url">URL</h2>
<p><a target="_blank" href="https://leetcode.com/problems/number-of-enclaves/description/">Number of Enclaves - 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/1020/main.fsx">https://github.com/syohex/dotnet-study/tree/master/fsharp/leetcode/problems/1020/main.fsx</a></p>
<pre><code class="lang-plaintext">let numEnclaves (grid: int[,]) : int =
    let rows, cols = Array2D.length1 grid, Array2D.length2 grid
    let steps = [ (-1, 0); (0, -1); (1, 0); (0, 1) ]

    let rec dfs row col =
        if row &lt; 0 || row &gt;= rows || col &lt; 0 || col &gt;= cols then
            None
        elif grid.[row, col] = 0 then
            Some(0)
        else
            grid.[row, col] &lt;- 0

            steps
            |&gt; List.fold
                (fun acc (x, y) -&gt;
                    let r, c = row + x, col + y
                    match dfs r c, acc with
                    | _, None -&gt; None
                    | None, _ -&gt; None
                    | Some(v), Some(w) -&gt; Some(v + w))
                (Some(1))

    let mutable ret = 0

    for i in 0 .. (rows - 1) do
        for j in 0 .. (cols - 1) do
            if grid.[i, j] = 1 then
                match dfs i j with
                | None -&gt; ret &lt;- ret + 0
                | Some(v) -&gt;
                    ret &lt;- ret + v

    ret
</code></pre>


## URL

[Number of Enclaves - LeetCode](https://leetcode.com/problems/number-of-enclaves/description/)

## Code

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

```plaintext
let numEnclaves (grid: int[,]) : int =
    let rows, cols = Array2D.length1 grid, Array2D.length2 grid
    let steps = [ (-1, 0); (0, -1); (1, 0); (0, 1) ]

    let rec dfs row col =
        if row < 0 || row >= rows || col < 0 || col >= cols then
            None
        elif grid.[row, col] = 0 then
            Some(0)
        else
            grid.[row, col] <- 0

            steps
            |> List.fold
                (fun acc (x, y) ->
                    let r, c = row + x, col + y
                    match dfs r c, acc with
                    | _, None -> None
                    | None, _ -> None
                    | Some(v), Some(w) -> Some(v + w))
                (Some(1))

    let mutable ret = 0

    for i in 0 .. (rows - 1) do
        for j in 0 .. (cols - 1) do
            if grid.[i, j] = 1 then
                match dfs i j with
                | None -> ret <- ret + 0
                | Some(v) ->
                    ret <- ret + v

    ret
```

LeetCode 1020. Number of Enclaves in F#

URL

Code