# 1020. Number of Enclaves

Given a 2D array `A`, each cell is 0 (representing sea) or 1 (representing land)

A move consists of walking from one land square 4-directionally to another land square, or off the boundary of the grid.

Return the number of land squares in the grid for which we cannot walk off the boundary of the grid in any number of moves.

Example 1:

``````Input: [[0,0,0,0],[1,0,1,0],[0,1,1,0],[0,0,0,0]]
Output: 3
Explanation:
There are three 1s that are enclosed by 0s, and one 1 that isn't enclosed because its on the boundary.
``````

Example 2:

``````Input: [[0,1,1,0],[0,0,1,0],[0,0,1,0],[0,0,0,0]]
Output: 0
Explanation:
All 1s are either on the boundary or can reach the boundary.
``````

Note:

1. `1 <= A.length <= 500`
2. `1 <= A[i].length <= 500`
3. `0 <= A[i][j] <= 1`
4. All rows have the same size.

``````class Solution {
public:
int numEnclaves(vector<vector<int>>& A) {
int res = 0, m = A.size(), n = A[0].size();
queue<vector<int>> q;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
res += A[i][j];
if (i * j == 0 || i == m - 1 || j == n - 1) q.push({i, j});
}
}
while (!q.empty()) {
int x = q.front()[0], y = q.front()[1]; q.pop();
if (x < 0 || x >= m || y < 0 || y >= n || A[x][y] != 1) continue;
A[x][y] = 0;
--res;
q.push({x + 1, y});
q.push({x - 1, y});
q.push({x, y + 1});
q.push({x, y - 1});
}
return res;
}
};
``````

``````class Solution {
public:
int numEnclaves(vector<vector<int>>& A) {
int res = 0, m = A.size(), n = A[0].size();
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (i * j == 0 || i == m - 1 || j == n - 1) helper(A, i, j);
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j) {
if (A[i][j] == 1) ++res;
}
}
return res;
}
void helper(vector<vector<int>>& A, int i, int j) {
if (i < 0 || i >= A.size() || j < 0 || j >= A[0].size() || A[i][j] != 1) return;
A[i][j] = 0;
helper(A, i + 1, j);
helper(A, i - 1, j);
helper(A, i, j + 1);
helper(A, i, j - 1);
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1020

https://leetcode.com/problems/number-of-enclaves/

https://leetcode.com/problems/number-of-enclaves/discuss/266168/Easy-Java-DFS-6ms-solution

https://leetcode.com/problems/number-of-enclaves/discuss/265555/C%2B%2B-with-picture-DFS-and-BFS

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation