<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 dfs(self,r,c,grid,vis,n):
        vis[r][c]=1
        if(c+1<n and grid[r][c+1]==grid[r][c] and vis[r][c+1]==0):
            self.dfs(r,c+1,grid,vis,n)
        if(r+1<n and grid[r+1][c]==grid[r][c] and vis[r+1][c]==0):
            self.dfs(r+1,c,grid,vis,n)
        if(c-1>-1 and grid[r][c-1]==grid[r][c] and vis[r][c-1]==0):
            self.dfs(r,c-1,grid,vis,n)
        if(r-1>-1<n and grid[r-1][c]==grid[r][c] and vis[r-1][c]==0):
            self.dfs(r-1,c,grid,vis,n)
    def createMatrix(self,shape,matrix,row,column):
        if(shape=="/"):
            matrix[3*row][3*column+2]=1
            matrix[3*row+1][3*column+1]=1
            matrix[3*row+2][3*column]=1
        elif(shape == "\\" ):
            matrix[3*row][3*column]=1
            matrix[3*row+1][3*column+1]=1
            matrix[3*row+2][3*column+2]=1

    def validate(self,cell1,cell2,case):
        if(cell1==cell2==case):
            return  True 
        return False   

    def regionsBySlashes(self, grid: List[str]) -> int:

        n=len(grid)
        matrix=[]
        for i in range(3*n):
            matrix.append([0]*(3*n))
        for i in range(n):
            for j in range(n):
                if(grid[i][j]==" "):
                    continue
                else:
                    self.createMatrix(grid[i][j],matrix,i,j)
        n=len(matrix)
        vis=[]
        for i in range(n):
            vis.append([0]*n)
        ans=0
        for i in range(n):
            for j in range(n):
                if(vis[i][j]==0 and matrix[i][j]==0):
                    ans+=1
                    self.dfs(i,j,matrix,vis,n)
        
        return ans
  
        
17015