Method numEnclaves

java/1020-number-of-enclaves.java:32–45

(int[][] board)

        dfs(r, c-1, board);
    }
    public int numEnclaves(int[][] board) {
        int n=board.length, m=board[0].length;

        for(int i=0; i<n; i++){
            if(board[i][0] == 1) dfs(i, 0, board);
            if(board[i][m-1] == 1) dfs(i, m-1, board);
        }

        for(int i=1; i<m-1; i++){
            if(board[0][i] == 1) dfs(0, i, board);
            if(board[n-1][i] == 1) dfs(n-1, i, board);
        }
        return count(board);
    }
}