Method count

java/1020-number-of-enclaves.java:11–21

(int [][]board)

class Solution {
    public int count(int [][]board){
        int c = 0;
        for(int i=0; i<board.length; i++){
            for(int j=0; j<board[0].length; j++){
                if(board[i][j] == 1){
                    c++;
                }
            }
        }
        return c;
    }
    public void dfs(int r, int c, int[][] board){
        if(r<0 || c<0 || r>board.length-1 || c>board[0].length-1 || board[r][c] != 1) return;