<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 {
public: 

    void island(vector<vector<int>> &g, vector<vector<int>> &temp, int i, int j, int m, int n)
    {
        temp[i][j] = 1;
        if (i < m-1 && temp[i+1][j] == 0 && g[i+1][j] == 1  )  
        {
            island(g, temp, i+1, j, m, n);
        }
        if (j < n-1 && temp[i][j+1] == 0 && g[i][j+1] == 1  )  
        {
            island(g, temp, i, j+1, m, n);
        }
        if (i > 0 && temp[i-1][j] == 0 && g[i-1][j] == 1  )
        {
            island(g, temp, i-1, j, m, n);
        }
        if (j > 0 && temp[i][j-1] == 0 && g[i][j-1] == 1  )  
        {
            island(g, temp, i, j-1, m, n);
        }
        
        //return 0;
    }

    int minDays(vector<vector<int>>& grid) {
        int count = 0;
        int m = grid.size(), n = grid[0].size();
        vector<vector<int>> temp (m, vector<int>(n, 0));

        for (int i = 0; i<m; i++)
        {
            for(int j = 0; j<n; j++)
            {
                if (grid[i][j]==1 && temp[i][j]==0)
                {
                    count++;
                    //temp[i][j] = 1;
                    island(grid, temp, i, j, m, n);
                }
            }
        }
cout<<"tc";
        if (count == 0) return 0;
        if (count >= 2) return 0;
        cout<<"tc";
        // if (m == 0 || n == 1 || grid[0][0] == 1 || grid[0][1] == 1) 
        // {
        //     return 2;
        // }

        //else
        //{
            //count = 0;
            for (int i = 0; i<m; i++)
            {
                for(int j = 0; j<n; j++)
                {
                    if (grid[i][j]==1)
                    {
                        int tc = 0;
                        vector<vector<int>> tempo (m, vector<int>(n, 0));
                        tempo[i][j]=1;
 
                        for (int a = 0; a<m; a++)
                        {
                            for(int b = 0; b<n; b++)
                            {
                                if(grid[a][b]==1 && tempo[a][b]==0)
                                {
                                tc++;
                                island(grid, tempo, a, b, m, n);
                                }

                            }
                        }
                        cout<<"tc";
                        if(tc != 1) return 1;
                        //else return 2;
                    }
                    cout<<"tc";
                }
                cout<<"tc";
            }
        //} 

        

cout<<"tc";
        return 2;

    }
};
25020