Create RottenOranges.cpp

Graphs/RottenOranges.cpp

@@ -0,0 +1,53 @@
+class Solution {
+public:
+    int orangesRotting(vector<vector<int>>& grid) {
+         int n=grid.size();
+        int m=grid[0].size();
+        // {{},time}
+
+        queue<pair<pair<int,int>,int>>q;
+        int visited[n][m];
+        for(int i=0;i<n;i++){
+            for(int j=0;j<m;j++){
+                if(grid[i][j]==2){
+                    q.push({{i,j},0});
+                    visited[i][j]=2;
+                }
+                else{
+                    visited[i][j]=0;
+                }
+            }
+        }
+        int timing=0;
+        int delrow[]={-1,0,+1,0};
+        int delcol[]={0,+1,0,-1};
+        while(!q.empty()){
+            int r=q.front().first.first;
+            int c=q.front().first.second;
+            int t=q.front().second;
+            timing=max(timing,t);
+            q.pop();
+            for(int i=0;i<4;i++){
+                int nrow=r+delrow[i];
+                int ncol=c+delcol[i];
+
+                if(nrow>=0 && nrow<n && ncol>=0 && ncol<m && visited[nrow][ncol]==0 && grid[nrow][ncol]==1){
+                    q.push({{nrow,ncol},t+1});
+                    visited[nrow][ncol]=2;
+                    // move++;
+                }
+            }
+
+
+        }
+
+        for(int i=0;i<n;i++){
+            for(int j=0;j<m;j++){
+                if(visited[i][j]!=2 && grid[i][j]==1){
+                    return -1;
+                }
+            }
+        }
+        return timing;
+    }
+};