From 2ee28115bf40b609c29d0382fe93d39cb44e14c8 Mon Sep 17 00:00:00 2001
From: MariaThomson <62303971+MariaThomson@users.noreply.github.com>
Date: Sun, 24 Oct 2021 22:21:29 +0530
Subject: [PATCH] added number of islands program

---
 CPP/Number of Islands.cpp | 75 +++++++++++++++++++++++++++++++++++++++
 1 file changed, 75 insertions(+)
 create mode 100644 CPP/Number of Islands.cpp

diff --git a/CPP/Number of Islands.cpp b/CPP/Number of Islands.cpp
new file mode 100644
index 0000000..1bfba34
--- /dev/null
+++ b/CPP/Number of Islands.cpp	
@@ -0,0 +1,75 @@
+//Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
+
+
+class Solution {
+ struct node{
+    int x;
+    int y;
+    node(int _x,int _y)
+    {
+        x=_x;
+        y=_y;
+    }
+};
+ public:
+  int visited[1000][1000];
+void bfs(int i,int j,int n,int m,vector<vector<char>>& grid)
+{
+    queue<node>q;
+    q.push(node(i,j));
+    visited[i][j]=1;
+    cout<<i<<" "<<j<<endl;
+    while(!q.empty())
+    {
+        int a=q.front().x;
+        int b=q.front().y;
+        q.pop();
+        cout<<a<<" "<<b<<endl;
+        int ar1[4]={1,0,-1,0};
+        int ar2[4]={0,-1,0,1};
+        for(int k=0;k<4;k++)
+        {
+            int c=a+ar1[k];
+            int d=b+ar2[k];
+        
+            if(c>=0 && c<n && d>=0 && d<m && visited[c][d]==0)
+            {
+                visited[c][d]=1;
+                q.push(node(c,d));
+            }
+        }
+    }
+}
+int numIslands(vector<vector<char>>& grid) {
+   int n=grid.size();
+   int m=grid[0].size();
+    
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<m;j++)
+        {
+            if(grid[i][j]=='1')
+            {
+                visited[i][j]=0;
+            }
+            else{
+                visited[i][j]=1;
+            }
+        }
+    }
+    
+    int count=0;
+    for(int i=0;i<n;i++)
+    {
+        for(int j=0;j<m;j++)
+        {
+            if(grid[i][j]=='1' && visited[i][j]==0)
+            {
+              bfs(i,j,n,m,grid); 
+                count++;
+            }
+        }
+    }
+    
+   return count; 
+}};
\ No newline at end of file