Method mark

java/0934-shortest-bridge.java:40–49

(int[][] grid, boolean[][] vis , Queue<int[]> q, int i, int j)

    }

    void mark(int[][] grid, boolean[][] vis , Queue<int[]> q, int i, int j) {
        if (i < 0 || j < 0 || i >= grid.length || j >= grid[0].length || grid[i][j] == 0 || vis[i][j]) return;
        vis[i][j] = true;
        q.add(new int[]{i,j});
        mark(grid, vis, q, i + 1, j);
        mark(grid, vis, q, i - 1, j);
        mark(grid, vis, q, i, j + 1);
        mark(grid, vis, q, i, j - 1);

    } 
}