LeetCode-200.Number of Islands

Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.

Example 1:

Input:
11110
11010
11000
00000

Output: 1

Example 2:

Input:
11000
11000
00100
00011

Output: 3

使用dfs

class Solution {//dfs my
    public int numIslands(char[][] grid) {
        if(null==grid||0==grid.length){
            return 0;
        }
        int row =grid.length;
        int col = grid[0].length;
        int re = 0;
        boolean[][] visited=new boolean[row][col];//判断的是否访问过
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if('1'==grid[i][j]&&!visited[i][j]){//为1且没有访问过，表示是另一个岛
                    dfs(grid,visited,i,j);
                    re++;
                }
            }
        }
        return re;
    }
    private void dfs(char[][] grid,boolean[][] visited,int i,int j){
        if(i<0||j<0||i>=grid.length||j>=grid[0].length){
            return;
        }
        if('1'==grid[i][j]&&!visited[i][j]){
            visited[i][j]=true;
            dfs(grid,visited,i+1,j);
            dfs(grid,visited,i-1,j);
            dfs(grid,visited,i,j+1);
            dfs(grid,visited,i,j-1);
        }
    }
}

 

使用并查集，且并查集合并使用rank（按秩合并即按高度）的方法

class Solution {//并查集 mytip
    public int numIslands(char[][] grid) {
        if(null==grid||0==grid.length){
            return 0;
        }
        int row =grid.length;
        int col = grid[0].length;
        int re = 0;
        UnionFind uf = new UnionFind(grid);
        int[][] dir ={{0,-1},{0,1},{-1,0},{1,0}};//方向数组
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if('1'==grid[i][j]){
                    for(int k=0;k<dir.length;k++){
                        int x = i+dir[k][0];
                        int y = j+dir[k][1];
                        if(x>=0&&x<row&&y>=0&&y<col&&'1'==grid[x][y]){
                            uf.union(i*col+j,x*col+y);
                        }
                    }
                }
            }
        }
        return uf.getCount();
    }
}
class UnionFind{
    private int[] parents;//各点的父节点
    private int[] ranks;//各点的高
    private int count;//本题的结果，即集合个数
    public UnionFind(int n){
        parents= new int[n];
        ranks = new int[n];
        for(int i=0;i<n;i++){
            parents[i]=i;
        }
    }
    public UnionFind(char[][] grid){
        int num = grid.length*grid[0].length;
        parents = new int[num];
        ranks = new int[num];
        for(int i=0;i<grid.length;i++){
            for(int j=0;j<grid[0].length;j++){
                if('1'==grid[i][j]){
                    parents[i*grid[0].length+j]= i*grid[0].length+j;
                    count++;
                }
            }
        }
    }
    public int getCount(){
        return this.count;
    }
    public int find(int x){
        while(x!=parents[x]){
            x= parents[x];
        }
        return x;
    }
    public void union(int x,int y){//分别找到各自的根节点，若根不相同则执行合并
        int rootx = find(x);
        int rooty = find(y);
        if(rootx!=rooty){
            if(ranks[rootx]<ranks[rooty]){
                parents[rootx] = rooty;
            }
            else if(ranks[rooty]<ranks[rootx]){
                parents[rooty] = rootx;
            }
            else{
                parents[rooty]=rootx;
                ranks[rootx]++;
            }
            count--; 
        }
        
    }
}

 适用并查集，且并查集合并适用路径压缩的方法

class Solution {//并查集 mytip
    public int numIslands(char[][] grid) {
        if(null==grid||0==grid.length){
            return 0;
        }
        int row =grid.length;
        int col = grid[0].length;
        int re = 0;
        UnionFind uf = new UnionFind(grid);
        int[][] dir ={{0,-1},{0,1},{-1,0},{1,0}};
        for(int i=0;i<row;i++){
            for(int j=0;j<col;j++){
                if('1'==grid[i][j]){
                    for(int k=0;k<dir.length;k++){
                        int x = i+dir[k][0];
                        int y = j+dir[k][1];
                        if(x>=0&&x<row&&y>=0&&y<col&&'1'==grid[x][y]){
                            uf.union(i*col+j,x*col+y);
                        }
                    }
                }
            }
        }
        return uf.getCount();
    }
}
class UnionFind{
    private int[] parents;//根节点
    private int count;
    public UnionFind(int n){
        parents= new int[n];
        for(int i=0;i<n;i++){
            parents[i]=i;
        }
    }
    public UnionFind(char[][] grid){
        parents = new int[grid.length*grid[0].length];
        for(int i=0;i<grid.length;i++){
            for(int j=0;j<grid[0].length;j++){
                if('1'==grid[i][j]){
                    parents[i*grid[0].length+j]= i*grid[0].length+j;
                    count++;
                }
            }
        }
    }
    public int getCount(){
        return this.count;
    }
    public int find(int x){//找到根节点，并把路径中所有点的父节点都设为根节点
        int root = x;
        while(root!=parents[root]){
            root= parents[root];
        }
        while(parents[x]!=root){
            int tmp = parents[x];
            parents[x] =root;
            x = tmp;
        }
        return root;
    }
    public void union(int x,int y){
        int rootx = find(x);
        int rooty = find(y);
        if(rootx!=rooty){
            parents[rooty] = rootx;
            count--; 
        }
        
    }
}