<p>You are given an <code>m x n</code> binary grid <code>grid</code> where <code>1</code> represents land and <code>0</code> represents water. An <strong>island</strong> is a maximal <strong>4-directionally</strong> (horizontal or vertical) connected group of <code>1</code>&#39;s.</p>

<p>The grid is said to be <strong>connected</strong> if we have <strong>exactly one island</strong>, otherwise is said <strong>disconnected</strong>.</p>

<p>In one day, we are allowed to change <strong>any </strong>single land cell <code>(1)</code> into a water cell <code>(0)</code>.</p>

<p>Return <em>the minimum number of days to disconnect the grid</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/24/land1.jpg" style="width: 500px; height: 169px;" />
<pre>
<strong>Input:</strong> grid = [[0,1,1,0],[0,1,1,0],[0,0,0,0]]

<strong>Output:</strong> 2
<strong>Explanation:</strong> We need at least 2 days to get a disconnected grid.
Change land grid[1][1] and grid[0][2] to water and get 2 disconnected island.
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/12/24/land2.jpg" style="width: 404px; height: 85px;" />
<pre>
<strong>Input:</strong> grid = [[1,1]]
<strong>Output:</strong> 2
<strong>Explanation:</strong> Grid of full water is also disconnected ([[1,1]] -&gt; [[0,0]]), 0 islands.
</pre>

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

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

class Solution:
    def minDays(self, grid: List[List[int]]) -> int:
        rows = len(grid)
        cols = len(grid[0])

        s = 0
        for i in range(rows):
            for j in range(cols):
                s += grid[i][j]
        if s == 1:
            return 1

        for row in grid:
            print(row)

        def dfs(i,j,visited):
            if i not in range(0,rows) or j not in range(0,cols) or (i,j) in visited:
                return
            if grid[i][j] == 1:
                visited.add((i,j))
                dfs(i+1,j,visited)
                dfs(i-1,j,visited)
                dfs(i,j+1,visited)
                dfs(i,j-1,visited)
        
        def countIslands():
            numIslands = 0
            visited = set()
            for i in range(rows):
                for j in range(cols):
                    if grid[i][j] == 1 and (i,j) not in visited:
                        dfs(i,j,visited)
                        numIslands += 1
                        if numIslands > 1:
                            return 2
            return numIslands
        
        if countIslands() != 1:
            return 0
        
        # bridge = False
        for i in range(rows):
            for j in range(cols):
                if grid[i][j] == 1:
                    walk = [
                        (i-1,j-1),
                        (i-1,j),
                        (i-1,j+1),
                        (i  ,j+1),
                        (i+1,j+1),
                        (i+1,j),
                        (i+1,j-1),
                        (i  ,j-1)
                    ]

                    changes = []                    
                    for r,c in walk:
                        if r not in range(0,rows) or c not in range(0,cols):
                            if not changes or changes[-1] != 0:
                                changes.append(0)
                            continue
                            
                        if not changes or grid[r][c] != changes[-1]:
                            changes.append(grid[r][c])
                            continue

                    print(i,j,changes)

                    if len(changes) < 4:
                        continue
                    if changes[0] == changes[-1]:
                        changes.pop()
                    if len(changes) < 4:
                        continue

                    


                    grid[i][j] = 0
                    if countIslands() != 1:
                        return 1
                    grid[i][j] = 1

                # s = 0
                # for x in range(max(0,i-1),min(rows,i+2)):
                #     for y in range(max(0,j-1),min(cols,j+2)):
                #         s += grid[x][y]

                # if s <= 3:
                #     bridge = True
                # elif i == 0 or i == rows-1 or j == 0 or j == cols - 1:
                #     continue
                # elif grid[i-1][j-1] == grid[i+1][j+1] == 0:
                #     bridge = True
                # elif grid[i-1][j] == grid[i+1][j] == 0: 
                #     bridge = True
                # elif grid[i][j-1] == grid[i][j+1] == 0:
                #     bridge = True
                # elif grid[i+1][j-1] == grid[i-1][j+1] == 0:
                #     bridge = True

                # if bridge:
                #     grid[i][j] = 0
                #     break
                
        return 2


    
157