<p>Given an <code>n x n</code> binary matrix <code>grid</code>, return <em>the length of the shortest <strong>clear path</strong> in the matrix</em>. If there is no clear path, return <code>-1</code>.</p>

<p>A <strong>clear path</strong> in a binary matrix is a path from the <strong>top-left</strong> cell (i.e., <code>(0, 0)</code>) to the <strong>bottom-right</strong> cell (i.e., <code>(n - 1, n - 1)</code>) such that:</p>

<ul>
	<li>All the visited cells of the path are <code>0</code>.</li>
	<li>All the adjacent cells of the path are <strong>8-directionally</strong> connected (i.e., they are different and they share an edge or a corner).</li>
</ul>

<p>The <strong>length of a clear path</strong> is the number of visited cells of this path.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/example1_1.png" style="width: 500px; height: 234px;" />
<pre>
<strong>Input:</strong> grid = [[0,1],[1,0]]
<strong>Output:</strong> 2
</pre>

<p><strong class="example">Example 2:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/02/18/example2_1.png" style="height: 216px; width: 500px;" />
<pre>
<strong>Input:</strong> grid = [[0,0,0],[1,1,0],[1,1,0]]
<strong>Output:</strong> 4
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> grid = [[1,0,0],[1,1,0],[1,1,0]]
<strong>Output:</strong> -1
</pre>

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

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

class Solution {
public:
    // void bfs(int a,int b,int c, int& ans , vector<vector<int>>&vis ,vector<vector<int>>&path, vector<vector<int>>grid){
    //     vis[a][b]=1;
    //     path[a][b]=c;
    //     // cout<<a<<" "<<b<<" "<<c<<endl;
        // for(int i=-1 ; i<=1 ; i++){
        //     for(int j=-1 ; j<=1 ; j++){
        //         if(i==0 && j==0)continue;
        //         int m=a+i;
        //         int n=b+j;
        //         // int sum=abs(i)+abs(j);
        //         // cout<<" "<<m<<" "<<n<<" "<<sum<<endl;
        //         if(m>=0 && m<grid.size() && n>=0 && n<grid[a].size()  && (vis[m][n]==0 || path[m][n]>c+1) && grid[m][n]==0){  
        //             bfs(m,n,c+1,ans,vis,path,grid);
        //         }
        //     }
        // }
        // if(a==grid.size()-1 && b==grid[a].size()-1){
        //     if(ans==-1)ans=c;
        //     else{
        //         ans=min(ans,c);
        //     }
        // }
    //     return;
    // }
    int shortestPathBinaryMatrix(vector<vector<int>>& grid) {
        // int m=grid.size();
        // int n=grid[0].size();
        // vector<vector<int>>vis(m,vector<int>(n,0));
        // vector<vector<int>>path(m,vector<int>(n,INT_MAX));
        // int ans=-1;
        // if(grid[0][0]!=0)return -1;
        // bfs(0,0,1,ans,vis,path,grid);
        // return ans;
        int x=grid.size();
        int y=grid[0].size();
        queue<vector<int>>q;
        vector<vector<int>>vis(x,vector<int>(y,0));
        if(grid[0][0]!=0)return -1;
        int ans=-1;
        vis[0][0]=1;
        vector<int>t;
        t.push_back(0);
        t.push_back(0);
        t.push_back(1);
        q.push(t);
        while(!q.empty()){
            int a=q.front()[0];
            int b=q.front()[1];
            int c=q.front()[2];
            cout<<a<<" "<<b<<" "<<c<<endl;
            if(a==grid.size()-1 && b==grid[a].size()-1){
                ans=c;
            }
            q.pop();
            for(int i=-1 ; i<=1 ; i++){
                for(int j=-1 ; j<=1 ; j++){
                    if(i==0 && j==0)continue;
                    int m=a+i;
                    int n=b+j;
                    if(m>=0 && m<grid.size() && n>=0 && n<grid[a].size()  && vis[m][n]==0  && grid[m][n]==0){  
                        vis[m][n]=1;
                        vector<int>temp;
                        temp.push_back(m);
                        temp.push_back(n);
                        temp.push_back(c+1);
                        q.push(temp);
                    }
                }
            }
        }
        return ans;
    }
};
57653