代码随想录Day51|99.岛屿数量 深搜 99.岛屿数量 广搜 岛屿的最大面积

 深度优先

import java.util.Scanner;

public class Main{
    public static void main (String[] args) {
        
        Scanner sc = new Scanner(System.in);
        int row = sc.nextInt();
        int col = sc.nextInt();
        int res = 0;
        if(row == 0 || col ==0){
            System.out.println(res);
            return;
        }
        int[][] grid = new int[row][col];
        for(int i = 0; i < row;i++){
            for(int j = 0;j < col; j++){
                grid[i][j] = sc.nextInt();
            }
        }
        
        for(int i = 0; i < row; i++){
            for(int j =0; j < col; j++){
                if(grid[i][j] == 1){
                    res++;
                    dfs(grid, i, j, row, col);
                }
            }
        }
        System.out.println(res);
        return;
        
        
        /*/
        for(int i = 0; i < row;i++){
            for(int j = 0;j < col; j++){
                System.out.print(grid[i][j]);
            }
            System.out.println();
        }
        //*/
    }
    public static void dfs(int[][] grid, int x, int y, int row, int col){
        //这个函数不一定是两层for循环遍历时调用，也可能是递归时调用，这时候grid[x][y]不一定为1
        if(x<0 || y<0 ||x>=row || y>=col ||grid[x][y] == 0){
            return;
        }
        grid[x][y] = 0;
        dfs(grid, x, y+1, row, col);
        dfs(grid, x, y-1, row, col);
        dfs(grid, x+1, y, row, col);
        dfs(grid, x-1, y, row, col);
    }
    
}

广度优先 

import java.util.*;

class pair{
    int first;
    int second;
    pair(int first, int second){
        this.first = first;
        this.second = second;
    }
    
}

public class Main{
    public static int[][] dir = {{0,1},{1,0},{0,-1},{-1,0}};
    public static void main (String[] args) {
        /* code */
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] grid = new int[n][m];
        int res = 0;
        boolean[][] visited = new boolean[n][m];
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                grid[i][j] = sc.nextInt();
            }
        }
        for(int i = 0; i<n; i++){
            for(int j = 0; j<m; j++){
                if(grid[i][j] == 1 && visited[i][j] == false){
                    res++;
                    bfs(grid,visited,i,j);
                }
            }
        }
        System.out.println(res);
    }
    
    public static void bfs(int[][] grid, boolean[][] visited, int x, int y){
        Queue<pair> que = new LinkedList<pair>();
        que.add(new pair(x,y));
        visited[x][y] = true;
        while(!que.isEmpty()){
            int curX= que.peek().first;
            int curY = que.poll().second;
            for(int i = 0; i< 4; i++){
                int nextX = curX + dir[i][0];
                int nextY = curY + dir[i][1];
                if(nextX<0 || nextX >= grid.length ||nextY <0 || nextY >=grid[0].length){
                    continue;
                }
                if(grid[nextX][nextY] == 1 && !visited[nextX][nextY]){
                    que.add(new pair(nextX,nextY));
                    visited[nextX][nextY] = true;
                }
            }
        }
    }
    
    
    
    
    

孤岛的总面积

import java.util.*;

class pair{
    int first;
    int second;
    pair(int first, int second){
        this.first = first;
        this.second = second;
    }
    
}

public class Main{
    
    public static int[][] dir = {{0,1},{1,0},{0,-1},{-1,0}};
    public static int count = 0;
    public static void main (String[] args) {
        /* code */
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[][] grid = new int[n][m];
        boolean[][] visited = new boolean[n][m];
        for(int i = 0; i<n; i++){
            for(int j = 0; j<m; j++){
                grid[i][j] = sc.nextInt();
            }
        }
        //遍历第一列和最后一列
        for(int i = 0; i < n; i++){
            if(grid[i][0] == 1 && visited[i][0] == false){
                bfs(grid,visited,i,0);
            }
            if(grid[i][m-1] == 1 && visited[i][m-1] == false){
                bfs(grid,visited,i,m-1);
            }
        }
        for(int j = 0; j< m; j++){
            if(grid[0][j] == 1 && visited[0][j] == false){
                bfs(grid,visited,0,j);
            }
            if(grid[n-1][j] == 1 && visited[n-1][j] == false){
                bfs(grid,visited,n-1,j);
            }
        }
        //Arrays.fill(visited,false);

        /*/
        for(int i = 0;i < n; i++){
            for(int j = 0; j< m; j++){
                System.out.print(grid[i][j]);
            }
            System.out.println();
        }
        //*/
        //System.out.println(count);
        count = 0;

        for(int i = 0; i<n; i++){
            for(int j = 0; j<m; j++){
                if(grid[i][j] == 1 &&visited[i][j] == false){
                    //System.out.println(i+""+j);
                    bfs(grid,visited, i, j);
                }
            }
        }
        System.out.println(count);

    }

    public static void bfs(int[][]grid, boolean[][]visited, int x,int y){
        Queue<pair> que = new LinkedList<pair>();
        que.add(new pair(x,y));
        visited[x][y] = true;
        while(que.isEmpty() == false){
            int curX = que.peek().first;
            int curY = que.poll().second;
            grid[curX][curY] = 0;
            
            count++;
            for(int i = 0; i< 4; i++){
                int nextX = curX + dir[i][0];
                int nextY = curY + dir[i][1];
                if(nextY<0 || nextY >= grid[0].length || nextX < 0 || nextX >= grid.length){
                    continue;
                }
                if(grid[nextX][nextY] == 1 && visited[nextX][nextY] == false){
                    que.add(new pair(nextX,nextY));
                    visited[nextX][nextY] = true;
                }
            }
            
            
            
            
            
        }
    }
}