-
Notifications
You must be signed in to change notification settings - Fork 1
/
Number of Enclaves
47 lines (47 loc) · 1.47 KB
/
Number of Enclaves
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
public:
int numberOfEnclaves(vector<vector<int>> &grid) {
queue<pair<int, int>> q;
int n = grid.size();
int m = grid[0].size();
int vis[n][m] = {0};
int count = 0;
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
//first row first col last row last col
if(i == 0 || j == 0 || i == n-1 || j == m-1){
if(grid[i][j] == 1){
q.push({i,j});
vis[i][j] = 1;
}
}
}
}
while(!q.empty()){
int row = q.front().first;
int col = q.front().second;
q.pop();
for(int delrow=-1;delrow<=1;delrow++){
for(int delcol=-1;delcol<=1;delcol++){
if(abs(delrow) == abs(delcol)){
continue;
}
int nrow = row+delrow;
int ncol = col+delcol;
if(nrow>=0 && nrow<n && ncol>=0 && ncol<m && vis[nrow][ncol] == 0 && grid[nrow][ncol] == 1){
q.push({nrow,ncol});
vis[nrow][ncol] = 1;
}
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(vis[i][j] == 0 && grid[i][j] == 1){
count++;
}
}
}
return count;
}
};