代码:
class Solution {
static int[][] dirs = {{-1,0},{1,0},{0,-1},{0,1}};
public int numEnclaves(int[][] grid) {
int sum=0;
for(int i=0;i<grid.length;i++){
for(int j=0;j<grid[0].length;j++){
if(grid[i][j]==1){
int[] start = {i,j};
int num = getIsland(1,start,grid);
if(num>0){
sum+=num;
}
}
}
}
return sum;
}
private int getIsland(int num,int[] start,int[][] grid){
grid[start[0]][start[1]] = 0;
for(int i=0;i<dirs.length;i++){
int x = start[0]+dirs[i][0];
int y = start[1]+dirs[i][1];
if(x<0||y<0||x==grid.length||y==grid[0].length){
num = -1;
}
if(x>=0&&x<grid.length&&y>=0&&y<grid[0].length&&grid[x][y]==1){
// grid[x][y] = 0;
int[] cur = {x,y};
if(num>=0){
num++;
}
num = getIsland(num,cur,grid);
}
}
return num;
}
}