<p>An <code>n x n</code> grid is composed of <code>1 x 1</code> squares where each <code>1 x 1</code> square consists of a <code>&#39;/&#39;</code>, <code>&#39;\&#39;</code>, or blank space <code>&#39; &#39;</code>. These characters divide the square into contiguous regions.</p>

<p>Given the grid <code>grid</code> represented as a string array, return <em>the number of regions</em>.</p>

<p>Note that backslash characters are escaped, so a <code>&#39;\&#39;</code> is represented as <code>&#39;\\&#39;</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/1.png" style="width: 200px; height: 200px;" />
<pre>
<strong>Input:</strong> grid = [&quot; /&quot;,&quot;/ &quot;]
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/2.png" style="width: 200px; height: 198px;" />
<pre>
<strong>Input:</strong> grid = [&quot; /&quot;,&quot;  &quot;]
<strong>Output:</strong> 1
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2018/12/15/4.png" style="width: 200px; height: 200px;" />
<pre>
<strong>Input:</strong> grid = [&quot;/\\&quot;,&quot;\\/&quot;]
<strong>Output:</strong> 5
<strong>Explanation: </strong>Recall that because \ characters are escaped, &quot;\\/&quot; refers to \/, and &quot;/\\&quot; refers to /\.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == grid.length == grid[i].length</code></li>
	<li><code>1 &lt;= n &lt;= 30</code></li>
	<li><code>grid[i][j]</code> is either <code>&#39;/&#39;</code>, <code>&#39;\&#39;</code>, or <code>&#39; &#39;</code>.</li>
</ul>

class Solution:
    def __init__(self):
        self.my_grid = []

    def floodfill(self, grid):
        res = 0 
        ROWS, COLS = len(grid), len(grid)
        num_colour = 0

        def dfs(r, c, colour):
            if (r not in range(ROWS) or
                c not in range(COLS) or 
                grid[r][c] != 0):
                return
            
            grid[r][c] = colour
            directions = [[1, 0], [-1, 0], [0, 1], [0, -1]]

            for dr, dc in directions:
                dfs(r + dr, c + dc, colour)

        for r in range(ROWS):
            for c in range(COLS):
                if grid[r][c] == 0:
                    num_colour += 1
                    dfs(r, c, num_colour)
        

        return num_colour
        

    def regionsBySlashes(self, grid: List[str]) -> int:
        n = len(grid)
        max_colour = 0 

        self.my_grid = [[0 for r in range(n*3)] for c in range(n*3)]

        for i in range(n):
            for j in range(n):
                if grid[i][j] == '/':
                    self.my_grid[i*3 + 0][j*3 + 2] = -1
                    self.my_grid[i*3 + 1][j*3 + 1] = -1
                    self.my_grid[i*3 + 2][j*3 + 0] = -1
                elif grid[i][j] == '\\':
                    self.my_grid[i*3 + 0][j*3 + 0] = -1
                    self.my_grid[i*3 + 1][j*3 + 1] = -1
                    self.my_grid[i*3 + 2][j*3 + 2] = -1
        
        return self.floodfill(self.my_grid)
18103